Something of The Book

PDF EPUB Library of e-Books

Metaheuristics for Vehicle Routing Problems

2016-02-23
Metaheuristics for Vehicle Routing Problems

Author: Nacima Labadie

Publisher: John Wiley & Sons

ISBN: 9781848218116

Category: Computers

Page: 193

View: 442

Download BOOK »
This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.

Metaheuristics for Vehicle Routing Problems

2016-02-10
Metaheuristics for Vehicle Routing Problems

Author: Nacima Labadie

Publisher: John Wiley & Sons

ISBN: 9781119136774

Category: Computers

Page: 194

View: 176

Download BOOK »
This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.

The Vehicle Routing Problem: Latest Advances and New Challenges

2008-07-20
The Vehicle Routing Problem: Latest Advances and New Challenges

Author: Bruce L. Golden

Publisher: Springer Science & Business Media

ISBN: 9780387777788

Category: Business & Economics

Page: 591

View: 501

Download BOOK »
In a unified and carefully developed presentation, this book systematically examines recent developments in VRP. The book focuses on a portfolio of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and VRP variations. Reflecting the most recent scholarship, this book is written by one of the top research scholars in Vehicle Routing and is one of the most important books in VRP to be published in recent times.

Metaheuristics to Solve Some Variants of Vehicle Routing Problems

2012-07
Metaheuristics to Solve Some Variants of Vehicle Routing Problems

Author: Jalel Euchi

Publisher: LAP Lambert Academic Publishing

ISBN: 365918232X

Category:

Page: 156

View: 472

Download BOOK »
Metaheuristics to solve some variants of vehicle routing problems. This book investigates an optimization problem concerning the distribution management in the supply chain. EUCHI address the Vehicle Routing Problems (VRP) with Heterogeneous Limited Fleet, through the development of resolution strategies with heuristic methods. Taking into account capacity constraints and the limited number of heterogeneous fleet of vehicles available, we studied three variants of vehicle routing problems: the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), the Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) and the Dynamic Vehicle Routing Problem (DVRP). We have applied Tabu search algorithms, evolutionary algorithms and ant colony algorithm to provide effective solutions to these problems.

Vehicle Routing Problem with Time Windows, Part II:

2003
Vehicle Routing Problem with Time Windows, Part II:

Author:

Publisher:

ISBN: OCLC:933024969

Category:

Page: 35

View: 993

Download BOOK »
The vehicle routing problem with time windows (VRPTW) has many useful applications in such areas as postal service, refuse collection, school bus routing, and just-in-time manufacturing. Over the last few years, many authors have proposed new heuristic approach for tackling the VRPTW, and the purpose of these two volumes is to survey this research. This second volume focusses on metaheuristic approaches. Section 1 reviews tabu search algorithms for the VRPTW. Section 2 covers genetic algorithms & evolution strategies as well as hybrids based on them. Other metaheuristic approaches are discussed in section 3, including methods such as simulated annealing, ant algorithms, guided local search, and variable neighbourhood search. Section 4 summarizes findings of the survey and analyzes the efficiency of the described metaheuristics by comparing computational results for Solomon's (1987) benchmark problems.

Recent Developments in Metaheuristics

2017-09-18
Recent Developments in Metaheuristics

Author: Lionel Amodeo

Publisher: Springer

ISBN: 9783319582535

Category: Business & Economics

Page: 496

View: 684

Download BOOK »
This book highlights state-of-the-art developments in metaheuristics research. It examines all aspects of metaheuristic research including new algorithmic developments, applications, new research challenges, theoretical developments, implementation issues, in-depth experimental studies. The book is divided into two sections. Part I is focused on new optimization and modeling techniques based on metaheuristics. The chapters in this section cover topics from multi-objective problems with fuzzy data with triangular-valued objective functions, to hyper-heuristics optimization methodology, designing genetic algorithms, and also the cuckoo search algorithm. The techniques described help to enhance the usability and increase the potential of metaheuristic algorithms. Part II showcases advanced metaheuristic approaches to solve real-life applications issues. This includes an examination of scheduling, the vehicle routing problem, multimedia sensor network, supplier selection, bin packing, objects tracking, and radio frequency identification. In the fields covered in the chapters are of high-impact applications of metaheuristics. The chapters offer innovative applications of metaheuristics that have a potential of widening research frontiers. Altogether, this book offers a comprehensive look at how researchers are currently using metaheuristics in different domains of design and application.

Solving Dynamic Vehicle Routing Problems

2011
Solving Dynamic Vehicle Routing Problems

Author: Mostepha Redouane Khouadjia

Publisher:

ISBN: OCLC:834904601

Category:

Page: 186

View: 976

Download BOOK »
Many problems in the real world have dynamic nature and can be modeled as dynamic combinatorial optimization problems. However, research on dynamic optimization focuses on continuous optimization problems, and rarely targets combinatorial problems. One of the applications in dynamic combinatorial problems that has received a growing interest during the last decades is the on-line or dynamic transportation systems. A typical problem of this domain is the Dynamic Vehicle Routing Problems (DVRPs). In this latter, the dynamism can be attributed to several factors (weather condition, new customer order, cancellation of old demand, vehicle broken down, etc.). In such application, information on the problem is not completely known a priori, but instead is revealed to the decision maker progressively with time. Consequently, solutions for different instances have to be found as time proceeds, concurrently with managing the incoming information. Such problems call for a methodology to track their optimal solutions through time. In this thesis, dynamic vehicle routing problem is addressed and developing general methodologies called metaheuristics to tackle this problem is investigated. Their ability to adapt to the changing environment and their robustness are discussed. Results of experiments demonstrate thanks to dynamic performance measures that our methods are effective on this problem and hence have a great potential for other dynamic combinatorial problems.

Meta-Heuristics

2012-12-06
Meta-Heuristics

Author: Ibrahim H. Osman

Publisher: Springer Science & Business Media

ISBN: 9781461313618

Category: Business & Economics

Page: 690

View: 187

Download BOOK »
Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial optimization theory in which heuristic algorithms have become an important area of research and applications. This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications. The book treats the following meta-heuristics and applications: Genetic Algorithms, Simulated Annealing, Tabu Search, Networks & Graphs, Scheduling and Control, TSP, and Vehicle Routing Problems. It represents research from the fields of Operations Research, Management Science, Artificial Intelligence and Computer Science.

Meta-Heuristics

2012-12-06
Meta-Heuristics

Author: Stefan Voß

Publisher: Springer Science & Business Media

ISBN: 9781461557753

Category: Business & Economics

Page: 511

View: 135

Download BOOK »
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.