Vehicle Routing: Problems, Methods, and Applications, Second EditionPaolo Toth, Daniele Vigo SIAM, 5. 12. 2014 - Počet stran: 481 Vehicle routing problems, among the most studied in combinatorial optimization, arise in many practical contexts (freight distribution and collection, transportation, garbage collection, newspaper delivery, etc.). Operations researchers have made significant developments in the algorithms for their solution, and Vehicle Routing: Problems, Methods, and Applications, Second Edition reflects these advances. The text of the new edition is either completely new or significantly revised and provides extensive and complete state-of-the-art coverage of vehicle routing by those who have done most of the innovative research in the area; it emphasizes methodology related to specific classes of vehicle routing problems and, since vehicle routing is used as a benchmark for all new solution techniques, contains a complete overview of current solutions to combinatorial optimization problems. It also includes several chapters on important and emerging applications, such as disaster relief and green vehicle routing. |
Obsah
1 | |
MO18_ch2 | 37 |
MO18_ch3 | 59 |
MO18_ch4 | 87 |
MO18_ch5 | 119 |
MO18_ch6 | 161 |
MO18_ch7 | 193 |
MO18_ch8 | 213 |
MO18_ch10 | 273 |
MO18_ch11 | 299 |
MO18_ch12 | 351 |
MO18_ch13 | 381 |
MO18_ch14 | 409 |
MO18_ch15 | 437 |
459 | |
MO18_ch9 | 241 |
Další vydání - Zobrazit všechny
Běžně se vyskytující výrazy a sousloví
applications approach Archetti B. L. GOLDEN backhauls Baldacci benchmark Branch-and-Cut algorithm cargo column Combinatorial Optimization Computers & Operations considered Cordeau cost customers CVRP DARP defined delivery problem demand depot Desaulniers disaster dynamic programming dynamic vehicle routing emissions European Journal exact algorithm feasible fleet formulation Gendreau genetic algorithm hybrid improvement instances integer integer programming iterations Journal of Operational Laporte loading local search Logistics lower bound Mathematical metaheuristics Mingozzi minimize multiple neighborhood search node number of vehicles objective function orienteering problem performed pickup and delivery Potvin prob procedure proposed PVRP relaxation reoptimization requests rithm routing and scheduling search algorithm search heuristic ship shortest path problem simulated annealing single vehicle solve speed stochastic strategies subproblem subset tabu search tion Toth Transportation Research Transportation Science traveling salesman problem Uchoa variables variants vehicle routing problem vertex vertices Vigo visited VRP4 VRPTW Wasil