Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Vehicle Routing Problem (VRP) dates back to the end of the fifties of the last century when Dantzig and Ramser set the mathematical programming formulation and algorithmic approach to solve the problem of delivering gasoline to service stations. Since then the interest in VRP evolved from a small group of mathematicians to a broad range of researchers and practitioners from different disciplines who are involved in this field today. Nine chapters of this book present recent improvements, innovative ideas and concepts regarding the vehicle routing problem. It will be of interest to students, researchers and practitioners with knowledge of the main methods for the solution of the combinatorial optimization problems.

Traveling salesman problem. --- Vehicle routing problem. --- VRP (Vehicle routing problem) --- Combinatorial optimization --- Traveling salesman problem --- TSP (Traveling salesman problem) --- Graph theory --- Vehicle routing problem --- Operational research

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.

Traveling-salesman problem. --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- Computer modelling & simulation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The world is on the edge of an economical breakthrough with the emergence of autonomous
cars. Such vehicles do not, or for a very short time, require the driver’s attention or even not
require a driver at all. This new era of vehicles is largely promoted by Tesla’s eccentric CEO
Elon Musk and the promotion of the S 3 X Y series of vehicles which include an autopilot mode.
In parallel to the emergence of autonomous cars, autonomous trucks are also in development and
are likely to revolutionize the transport sector and in particular freight transport. Again, Tesla
wants to be a pioneer in this domain with the Tesla Semi, which is supposed to arrive around
2021 on the market. Autonomous vehicles are expected to improve road safety by drastically
reducing the number of incidents. Furthermore, they are likely to be an excellent ally in the fight
against climate change by improving the road transport efficiency and reducing greenhouse gas
emissions.
The aim of this work is to emphasize the gains of using autonomous trucks over regular
trucks for freight transport. These gains are mainly based on the prime costs of such trucks but
also, in a lesser extent, to the greenhouse gas emissions. To do so, two similar trucks, one with
a driver and an autonomous one, are compared for different delivery situations, from national to
international level. While the autonomous truck can drive continuously, the driver is submitted
to the European legislation on driving and working hours. Their respective journey, which visits
a set of n clients selected randomly, is computed by minimizing either the driving time or the
driving distance. To each route, a monetary cost is associated which serves as a basis for the
comparison between the two trucks.

Autonomous trucks, Vehicle routing problem, optimization --- Sciences économiques & de gestion > Production, distribution & gestion de la chaîne logistique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Nowadays, congestion and pollution are challenging urban transportation systems. Low emission zones and e-commerce force distribution networks to become more flexible and efficient. The well-known Vehicle Routing Problem and its variants such as the Multi-Echelon Vehicle Routing Problem offer prospects for improvement in City Logistics. Based on the existing models, a new model is presented: the Multi-Echelon Multi-Satellite Multi-Product Capacitated Vehicle Routing Problem with one-day delay allowed. For the purpose of submitting a sustainable distribution network, a predominantly green freight is chosen to operate in the city and its suburban area. A local search based metaheuristic is developed to solve the model and evaluate the impact of the delay. The model and solving method are tested on realistic data on Liège-Namur area.

Multi-echelon vehicle routing problem --- Local search --- Metaheuristic --- Urban distribution network --- Sciences économiques & de gestion > Production, distribution & gestion de la chaîne logistique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The dial a ride problem (DARP) is a specific transportation problem. The objective is to optimise the planning of a collection of trips made by a fleet of vehicles. Those trips aim to satisfy requests from users while meeting various constraints. The cleared example is the transportation of the elderly or disabled people. The problem has received increase interest in recent years as the demand for services that can be solved through DARP is rising. Due to the aging of the population, this demand will be even bigger in the future. Good optimisation tools are needed to respond to it.
In this thesis, I review the different heuristics to solve DARP before implementing a hybrid Bee Algorithm with Deterministic Annealing. The different creation steps are described before the algorithm is tested on several instances. The results are then used to explore possible improvements to the algorithm. Several real-life problems are discussed along the way

Vehicle routing problem --- Dial a ride problem --- Optimisation --- Hybrid metaheuristic --- Bee algorithm --- Deterministic Annealing --- Sciences économiques & de gestion > Production, distribution & gestion de la chaîne logistique --- Ingénierie, informatique & technologie > Sciences informatiques