Local search heuristics for pollution-routing problem with multiple vehicle types and deadlines

Download
2013
Saka, Onur Can
Vehicle Routing Problem (VRP) is one of the most widely studied problems in logistics literature. Up to now, many different types of exact solution methods and heuristics have been developed in order to deal with various variants of this computationally complex optimization problem. However, only a few researchers have included the concepts of speed control, fuel consumption and greenhouse gas (GHG) emissions in their studies. The first part of this study is dedicated to a special variant of VRP called the Pollution-Routing Problem (PRP), which includes a comprehensive cost function that takes into account fuel consumption, GHG emissions and driver wages. An extension of PRP incorporating multiple vehicle types and deadlines is considered. Throughout this part, firstly two alternative exact solution methods are proposed: a Mixed Integer Programming model with a piecewise linear cost function and a Mixed Integer Second Order Cone Programming model, followed by local search heuristics with a special initialization algorithm and optimal travel time determination procedure. Results of experiments are interpreted in an extensive computational study. In the second part (See Appendix E), the report of an applied project is represented. The project took place in a third-party logistics (3PL) company in the Netherlands with the aim of investigating the possible improvements that can be achieved via employing a multi-depot and automated planning approach.

Suggestions

Mobility-on-demand scenarios relying on lightweight autonomous and connected vehicles for large pedestrian areas and intermodal hubs
Kumru, Murat; Makarem, Laleh; Gillet, Dens (null; 2017-10-05)
This paper presents Mobility-On-Demand (MoD) scenarios relying on lightweight autonomous and connected vehicles to ease commuting in large pedestrian areas and intermodal hubs. In particular, we discuss the case of the EPFL campus as an example of a large pedestrian area and the case of the main Zurich train station as an example of a large intermodal hub. These two scenarios help to investigate the potential benefits and the implementation challenges of innovative lightweight autonomous and connected vehic...
Vehicle routing problem in cross dockswith shift-based time constraints on products
Koçak, Menekşe; Serpil, Canan; Department of Industrial Engineering (2011)
In this study, the capacitated vehicle routing problem with shift based time constraints is taken into consideration. The study stemmed from an application in a cross dock. The considered cross dock is assumed to feed directly the production lines of its customer. The customer has a just-in-time production system that requires producing only in necessary quantities at the necessary times. This necessitates the arrival of the parts/products collected from different suppliers at the customer at the beginning ...
Approximate models and solution approaches for the vehicle routing problem with multiple use of vehicles and time windows
Boer, Jeroen Wouter de; Süral, Haldun; Department of Industrial Engineering (2008)
In this study we discuss the Vehicle Routing Problem with multiple use of vehicles (VRPM). In this variant of the routing problem the vehicles may replenish at any time at the depot. We present a detailed review of existing literature and propose two mathematical models to solve the VRPM. For these two models and their several variants we provide computational results based on the test problems taken from the literature. We also discuss a case study in which we are simultaneously dealing with side constrain...
Modeling of freight transportation on Turkish highways
Ünal, Leyla; Türel, Ali; Department of City and Regional Planning (2009)
Transportation planners are often faced with the problem of estimating passenger and freight flows between regions. In the literature there are many models for passenger flows. However, models about freight flows are more limited. Modeling freight flow is also more complex than modeling passenger flow and there are many agents related with freight flows. In addition, data availability is a critical factor. In this research, freight flows between provinces in Türkiye are forecasted by demand analysis. Transp...
A self-organizing neural network approach for the single AGV routing problem
Soylu, M; Özdemirel, Nur Evin; Kayaligil, S (2000-02-15)
In this research, a special form of Automated Guided Vehicle (AGV) routing problem is investigated. The objective is to find the shortest tour for a single, free-ranging AGV that has to carry out multiple pick and deliver (P&D) requests. This problem is an incidence of the asymmetric traveling salesman problem which is known to be NP-complete. An artificial neural network algorithm based on Kohonen's self-organizing feature maps is developed to solve the problem, and several improvements on the basic featur...
Citation Formats
O. C. Saka, “Local search heuristics for pollution-routing problem with multiple vehicle types and deadlines,” M.S. - Master of Science, Middle East Technical University, 2013.