A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- Author
- ALONSO, F1 ; ALVAREZ, M. J1 ; BEASLEY, J. E2
[1] Universidad de Navarra, San Sebastián, Spain
[2] Brunel University, Uxbridge, United Kingdom - Source
The Journal of the Operational Research Society. 2008, Vol 59, Num 7, pp 963-976, 14 p ; ref : 1/2 p
- CODEN
- JORSDZ
- ISSN
- 0160-5682
- Scientific domain
- Control theory, operational research
- Publisher
- Palgrave, Basingstoke
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- accessibility restrictions multi-trip multiple use of vehicles periodic vehicle routing problem site-dependencies tabu search
- Keyword (fr)
- Accessibilité Algorithme recherche Flotte Problème recherche Problème tournée véhicule Recherche tabou Routage
- Keyword (en)
- Accessibility Search algorithm Fleet Search problem Vehicle routing problem Tabu search Routing
- Keyword (es)
- Accesibilidad Algoritmo búsqueda Problema investigación Problema ruta vehículo Búsqueda tabú Enrutamiento
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20411748
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1057/palgrave.jors.2602405 
https://dx.doi.org/10.1057/palgrave.jors.2602405
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"59\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"963\";s:8:\"\u0000*\u0000epage\";s:3:\"976\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALONSO\";s:10:\"\u0000*\u0000aufirst\";s:1:\"F\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"ALVAREZ, M. J\";i:1;s:13:\"BEASLEY, J. E\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:8:\"Palgrave\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"59\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"963\";s:8:\"\u0000*\u0000epage\";s:3:\"976\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALONSO\";s:10:\"\u0000*\u0000aufirst\";s:1:\"F\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"ALVAREZ, M. J\";i:1;s:13:\"BEASLEY, J. E\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:8:\"Palgrave\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"59\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"963\";s:8:\"\u0000*\u0000epage\";s:3:\"976\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALONSO\";s:10:\"\u0000*\u0000aufirst\";s:1:\"F\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"ALVAREZ, M. J\";i:1;s:13:\"BEASLEY, J. E\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:8:\"Palgrave\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"59\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"963\";s:8:\"\u0000*\u0000epage\";s:3:\"976\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALONSO\";s:10:\"\u0000*\u0000aufirst\";s:1:\"F\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"ALVAREZ, M. J\";i:1;s:13:\"BEASLEY, J. E\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:8:\"Palgrave\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602405\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"59\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"963\";s:8:\"\u0000*\u0000epage\";s:3:\"976\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALONSO\";s:10:\"\u0000*\u0000aufirst\";s:1:\"F\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"ALVAREZ, M. J\";i:1;s:13:\"BEASLEY, J. E\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:123:\"A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:8:\"Palgrave\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
