Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach
- Author
- GONG, Yue-Jiao1 2 3 ; JUN ZHANG1 ; OU LIU4 ; HUANG, Rui-Zhang4 ; CHUNG, Henry Shu-Hung5 ; SHI, Yu-Hui6
[1] Department of Computer Science, Sun Yat-sen University, Guangzhou, China
[2] Key Laboratory of Digital Life, (Sun Yat-sen University), Ministry of Education,, China
[3] Key Laboratory of Software Technology, (Sun Yat-sen University), Education Department of Guangdong Province, China
[4] School of Accounting and Finance, The Hong Kong Polytechnic University, Kowloon, Hong-Kong
[5] Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong-Kong
[6] Department of Electrical and Electronic Engineering, Xi'an Jiaotong-Liverpool University, Suzhou, Jiangsu, China - Source
IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews. 2012, Vol 42, Num 2, pp 254-267, 14 p ; ref : 73 ref
- CODEN
- ITCRFH
- ISSN
- 1094-6977
- Scientific domain
- Computer science
- Publisher
- Institute of Electrical and Electronics Engineers, New-York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- Combinatorial optimization problems (COPs) set-based particle swarm optimization (S-PSO) vehicle routing problem with time windows (VRPTW)
- Keyword (fr)
- Algorithme évolutionniste Arithmétique Calcul ensembliste Efficacité Fenêtre temporelle Graphe complet Intelligence en essaim Logistique Mise à jour Méthode heuristique Optimisation combinatoire Plus proche voisin Problème NP difficile Problème tournée véhicule Programmation discrète Programmation mathématique Routage Sous graphe Système transport Temps discret Théorie graphe Optimisation PSO
- Keyword (en)
- Evolutionary algorithm Arithmetics Set computation Efficiency Time window Complete graph Swarm intelligence Logistics Updating Heuristic method Combinatorial optimization Nearest neighbour NP hard problem Vehicle routing problem Discrete programming Mathematical programming Routing Subgraph Transportation system Discrete time Graph theory Particle swarm optimization
- Keyword (es)
- Algoritmo evoluciónista Aritmética Calcúlo conjunto Eficacia Ventana temporal Grafo completo Inteligencia de enjambre Logística Actualización Método heurístico Optimización combinatoria Vecino más cercano Problema NP duro Problema ruta vehículo Programación discreta Programación matemática Enrutamiento Subgrafo Sistema de transporte Tiempo discreto Teoría grafo Optimización PSO
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph
- Discipline
- Computer science : theoretical automation and systems Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 25567989
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.1109/TSMCC.2011.2148712 
https://dx.doi.org/10.1109/TSMCC.2011.2148712
"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:26:\"10.1109\/TSMCC.2011.2148712\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:9:\"\u0000*\u0000jtitle\";s:83:\"IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews\";s:9:\"\u0000*\u0000stitle\";s:47:\"IEEE trans. syst. man cybern., Part C Appl. rev\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"254\";s:8:\"\u0000*\u0000epage\";s:3:\"267\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1094-6977\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"GONG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Yue-Jiao\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:5:{i:0;s:9:\"JUN ZHANG\";i:1;s:6:\"OU LIU\";i:2;s:16:\"HUANG, Rui-Zhang\";i:3;s:21:\"CHUNG, Henry Shu-Hung\";i:4;s:11:\"SHI, Yu-Hui\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ITCRFH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:8:\"\u0000*\u0000place\";s:12:\"New-York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of Electrical and Electronics Engineers\";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:26:\"10.1109\/TSMCC.2011.2148712\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:9:\"\u0000*\u0000jtitle\";s:83:\"IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews\";s:9:\"\u0000*\u0000stitle\";s:47:\"IEEE trans. syst. man cybern., Part C Appl. rev\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"254\";s:8:\"\u0000*\u0000epage\";s:3:\"267\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1094-6977\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"GONG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Yue-Jiao\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:5:{i:0;s:9:\"JUN ZHANG\";i:1;s:6:\"OU LIU\";i:2;s:16:\"HUANG, Rui-Zhang\";i:3;s:21:\"CHUNG, Henry Shu-Hung\";i:4;s:11:\"SHI, Yu-Hui\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ITCRFH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:8:\"\u0000*\u0000place\";s:12:\"New-York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of Electrical and Electronics Engineers\";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:26:\"10.1109\/TSMCC.2011.2148712\";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:26:\"10.1109\/TSMCC.2011.2148712\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:9:\"\u0000*\u0000jtitle\";s:83:\"IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews\";s:9:\"\u0000*\u0000stitle\";s:47:\"IEEE trans. syst. man cybern., Part C Appl. rev\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"254\";s:8:\"\u0000*\u0000epage\";s:3:\"267\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1094-6977\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"GONG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Yue-Jiao\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:5:{i:0;s:9:\"JUN ZHANG\";i:1;s:6:\"OU LIU\";i:2;s:16:\"HUANG, Rui-Zhang\";i:3;s:21:\"CHUNG, Henry Shu-Hung\";i:4;s:11:\"SHI, Yu-Hui\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ITCRFH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:8:\"\u0000*\u0000place\";s:12:\"New-York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of Electrical and Electronics Engineers\";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:26:\"10.1109\/TSMCC.2011.2148712\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:9:\"\u0000*\u0000jtitle\";s:83:\"IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews\";s:9:\"\u0000*\u0000stitle\";s:47:\"IEEE trans. syst. man cybern., Part C Appl. rev\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"254\";s:8:\"\u0000*\u0000epage\";s:3:\"267\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1094-6977\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"GONG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Yue-Jiao\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:5:{i:0;s:9:\"JUN ZHANG\";i:1;s:6:\"OU LIU\";i:2;s:16:\"HUANG, Rui-Zhang\";i:3;s:21:\"CHUNG, Henry Shu-Hung\";i:4;s:11:\"SHI, Yu-Hui\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ITCRFH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:8:\"\u0000*\u0000place\";s:12:\"New-York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of Electrical and Electronics Engineers\";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:26:\"10.1109\/TSMCC.2011.2148712\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:9:\"\u0000*\u0000jtitle\";s:83:\"IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews\";s:9:\"\u0000*\u0000stitle\";s:47:\"IEEE trans. syst. man cybern., Part C Appl. rev\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"254\";s:8:\"\u0000*\u0000epage\";s:3:\"267\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1094-6977\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"GONG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Yue-Jiao\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:5:{i:0;s:9:\"JUN ZHANG\";i:1;s:6:\"OU LIU\";i:2;s:16:\"HUANG, Rui-Zhang\";i:3;s:21:\"CHUNG, Henry Shu-Hung\";i:4;s:11:\"SHI, Yu-Hui\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ITCRFH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:105:\"Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach\";s:8:\"\u0000*\u0000place\";s:12:\"New-York, NY\";s:6:\"\u0000*\u0000pub\";s:49:\"Institute of Electrical and Electronics Engineers\";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
