Cargando…

Metaheuristics for vehicle routing problems.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Labadie, Nacima
Formato: Electrónico eBook
Idioma:Inglés
Publicado: [Place of publication not identified] : John Wiley, 2015.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a22000003 4500
001 EBOOKCENTRAL_ocn939712299
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|||||||||
008 160216s2015 xx o 000 0 eng d
040 |a YDXCP  |b eng  |e pn  |c YDXCP  |d IDEBK  |d EBLCP  |d OCLCQ  |d DEBSZ  |d IDB  |d OCLCO  |d OCLCF  |d OCLCQ  |d MERUC  |d ZCU  |d ICG  |d OCLCQ  |d DKC  |d OCLCQ  |d OCLCO  |d SGP  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 939864920 
020 |a 9781119136774  |q (electronic bk.) 
020 |a 1119136776  |q (electronic bk.) 
020 |a 9781119136781 
020 |a 1119136784 
020 |a 9781119136767 
020 |a 1119136768 
020 |z 1848218117 
020 |z 9781848218116 
020 |z 1119136784 
029 1 |a DEBBG  |b BV044060453 
029 1 |a DEBSZ  |b 48034700X 
035 |a (OCoLC)939712299  |z (OCoLC)939864920 
037 |a 897664  |b MIL 
050 4 |a QA402.6 
082 0 4 |a 519.7  |2 23 
049 |a UAMI 
100 1 |a Labadie, Nacima. 
245 1 0 |a Metaheuristics for vehicle routing problems. 
260 |a [Place of publication not identified] :  |b John Wiley,  |c 2015. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
505 0 |a Cover; Title Page; Copyright; Contents; Notations and Abbreviations; Notations; Abbreviations related to problems; Abbreviations related to methods; Introduction; Chapter 1. General Presentation of Vehicle Routing Problems; 1.1. Logistics management and combinatorial optimization; 1.1.1. History of logistics; 1.1.2. Logistics as a science; 1.1.3. Combinatorial optimization; 1.2. Vehicle routing problems; 1.2.1. Problems in transportation optimization; 1.2.2. Vehicle routing problems in other contexts; 1.2.3. Characteristics of vehicle routing problems; 1.2.3.1. Components 
505 8 |a 1.2.3.2. Constraints1.2.3.3. Objectives; 1.2.4. The capacitated vehicle routing problem; 1.2.4.1. Mathematical model; 1.2.4.2. Solution methods; 1.3. Conclusion; Chapter 2. Simple Heuristics and Local Search Procedures; 2.1. Simple heuristics; 2.1.1. Constructive heuristics; 2.1.2. Two-phase methods; 2.1.3. Best-of approach and randomization; 2.2. Local search; 2.2.1. Principle; 2.2.2. Classical moves; 2.2.3. Feasibility tests; 2.2.4. General approach from Vidal et al.; 2.2.5. Multiple neighborhoods; 2.2.6. Very constrained problems; 2.2.7. Acceleration techniques; 2.2.8. Complex moves 
505 8 |a 2.3. ConclusionChapter 3. Metaheuristics Generating a Sequence of Solutions; 3.1. Simulated annealing (SA); 3.1.1. Principle; 3.1.2. Simulated annealing in vehicle routing problems; 3.2. Greedy randomized adaptive search procedure: GRASP; 3.2.1. Principle; 3.2.2. GRASP in vehicle routing problems; 3.3. Tabu search; 3.3.1. Principle; 3.3.2. Tabu search in vehicle routing problems; 3.4. Variable neighborhood search; 3.4.1. Principle; 3.4.2. Variable neighborhood search in vehicle routing problems; 3.5. Iterated local search; 3.5.1. Principle 
505 8 |a 3.5.2. Iterated local search in vehicle routing problems3.6. Guided local search; 3.6.1. Principle; 3.6.2. Guided local search in vehicle routing problems; 3.7. Large neighborhood search; 3.7.1. Principle; 3.7.2. Large neighborhood search in vehicle routing problems; 3.8. Transitional forms; 3.8.1. Evolutionary local search principle; 3.8.2. Application to vehicle routing problems; 3.9. Selected examples; 3.9.1. GRASP for the location-routing problem; 3.9.2. Granular tabu search for the CVRP; 3.9.3. Adaptive large neighborhood search for the pickup and delivery problem with time windows 
505 8 |a 3.10. ConclusionChapter 4. Metaheuristics Based on a Set of Solutions; 4.1. Genetic algorithm and its variants; 4.1.1. Genetic algorithm; 4.1.2. Memetic algorithm; 4.1.3. Memetic algorithm with population management; 4.1.4. Genetic algorithm and its variants in vehicle routing problems; 4.2. Scatter search; 4.2.1. Scatter search principle; 4.2.2. Scatter search in vehicle routing problems; 4.3. Path relinking; 4.3.1. Principle; 4.3.2. Path relinking in vehicle routing problems; 4.4. Ant colony optimization; 4.4.1. Principle; 4.4.2. ACO in vehicle routing problems 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Transportation problems (Programming) 
650 0 |a Mathematical optimization. 
650 6 |a Problèmes de transport (Programmation) 
650 6 |a Optimisation mathématique. 
650 7 |a Mathematical optimization  |2 fast 
650 7 |a Transportation problems (Programming)  |2 fast 
758 |i has work:  |a Metaheuristics for vehicle routing problems (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGQgD7rtPh3wHktkk3gfC3  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Labadie, Nacima.  |t Metaheuristics for vehicle routing problems.  |d [Place of publication not identified] : John Wiley, 2015  |z 1848218117  |z 9781848218116  |w (OCoLC)908914279 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=4405837  |z Texto completo 
938 |a EBL - Ebook Library  |b EBLB  |n EBL4405837 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n cis31855691 
938 |a YBP Library Services  |b YANK  |n 12848408 
938 |a YBP Library Services  |b YANK  |n 12853982 
994 |a 92  |b IZTAP