|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910136252503321 |
|
|
Autore |
Labadie Nacima |
|
|
Titolo |
Metaheuristics for vehicle routing problems / / Nacima Labadie, Christian Prins, Caroline Prodhon |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 |
|
©2016 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-119-13678-4 |
1-119-13676-8 |
1-119-13677-6 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (197 p.) |
|
|
|
|
|
|
Collana |
|
Computer Engineering Series. Metaheuristics Set ; ; Volume 3 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Transportation problems (Programming) |
Mathematical optimization |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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 |
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 |
2.3. ConclusionChapter 3. Metaheuristics Generating a Sequence of |
|
|
|
|