Models and branch-and-cut algorithms for pickup and delivery problems with time windows
- Autor
- ROPKE, Stefan1 ; CORDEAU, Jean-Francois2 ; LAPORTE, Gilbert1
[1] Canada Research Chair in Distribution Management, HEC Montréal 3000, chemin de la Côte -Sainte -Catherine, Montréal H3T 2A7, Canada
[2] Canada Research Chair in Logistics and Transportation, HEC Montréal 3000, chemin de la Cóte -Sainte -Catherine, Montréal, H3T 2A7, Canada - Titulo de la conferencia
- Recent advances in vehicle routing optimization
- Nombre de la conferencia
- Route 2005 : International workshop on vehicle routing, intermodal transportation, and related areas (3 ; Bertinoro 2005-06-23)
- Autor ( monografía)
- VIGO, Daniele (Editor)1 ; TOTH, Paolo (Editor)1 ; MINGOZZI, Aristide (Editor)2
[1] Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Bologna, Italy
[2] Dipartimento di Matematica, Università di Bologna, Bologna, Italy - Fuente
Networks (New York, NY). 2007, Vol 49, Num 4, pp 258-272, 15 p ; ref : 23 ref
- CODEN
- NTWKAA
- ISSN
- 0028-3045
- Campo Científico
- Control theory, operational research
- Editor
- John Wiley & Sons, New York, NY
- País de la publicación
- United States
- Tipo de documento
- Conference Paper
- Idioma
- English
- Palabra clave de autor
- branch-and-cut pickup and delivery time windows valid inequalities
- Palabra clave (fr)
- Contrainte capacité Contrainte précédence Logistique Modélisation Méthode séparation et coupe Transport collectif à la demande Fenêtre temporelle
- Palabra clave (in)
- Capacity constraint Precedence constraint Logistics Modeling Branch and cut method Dial a ride Time window
- Palabra clave (es)
- Coacción capacidad Constreñimiento precedencia Logística Modelización Método branch and cut Transporte colectivo según demanda Ventana temporal
- Clasificación
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics
- Disciplina
- Operational research. Management
- Procedencia
- Inist-CNRS
- Base de datos
- PASCAL
- Identificador INIST
- 18920635
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
Acceso al documento
Install on your browser
DOI
10.1002/net.20177 
https://dx.doi.org/10.1002/net.20177
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1002\/net.20177\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"49\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"258\";s:8:\"\u0000*\u0000epage\";s:3:\"272\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"ROPKE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Stefan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:22:\"CORDEAU, Jean-Francois\";i:1;s:16:\"LAPORTE, Gilbert\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:47:\"Recent advances in vehicle routing optimization\";s:8:\"\u0000*\u0000title\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"15\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Panist
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1002\/net.20177\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"49\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"258\";s:8:\"\u0000*\u0000epage\";s:3:\"272\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"ROPKE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Stefan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:22:\"CORDEAU, Jean-Francois\";i:1;s:16:\"LAPORTE, Gilbert\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:47:\"Recent advances in vehicle routing optimization\";s:8:\"\u0000*\u0000title\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"15\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Istex
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:17:\"10.1002\/net.20177\";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;}"
Acceso mediante Unpaywall
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1002\/net.20177\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"49\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"258\";s:8:\"\u0000*\u0000epage\";s:3:\"272\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"ROPKE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Stefan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:22:\"CORDEAU, Jean-Francois\";i:1;s:16:\"LAPORTE, Gilbert\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:47:\"Recent advances in vehicle routing optimization\";s:8:\"\u0000*\u0000title\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"15\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Europe PubMed Central
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1002\/net.20177\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"49\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"258\";s:8:\"\u0000*\u0000epage\";s:3:\"272\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"ROPKE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Stefan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:22:\"CORDEAU, Jean-Francois\";i:1;s:16:\"LAPORTE, Gilbert\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:47:\"Recent advances in vehicle routing optimization\";s:8:\"\u0000*\u0000title\";s:87:\"Models and branch-and-cut algorithms for pickup and delivery problems with time windows\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"15\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante arXiv
