Vehicle routing problem in cross dockswith shift-based time constraints on products

Download

index.pdf

Date

2011

Author

Koçak, Menekşe

Metadata

Show full item record

Item Usage Stats

175
views

94
downloads

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 of each shift of production. The shift times constitute deadlines for the products to be collected from the suppliers and used in each shift. The collection problem then can be seen as the capacitated vehicle routing problem with shift based time constraints. The objective of the collection problem is to minimize the routing costs. For the accomplishment of this objective it is required to decide on products of which shift(s) should be taken from a supplier when a vehicle arrives at that supplier. For the solution of the problem a mathematical model is formulated. Since the dealt problem is NP-Hard, meta-heuristic solution approaches based on variable neighborhood search and simulated annealing are proposed. Computational experimentation is conducted on the test problems which are tailored from the capacitated vehicle routing instances from the literature.

Subject Keywords

Vehicle routing problem.

URI

http://etd.lib.metu.edu.tr/upload/12613945/index.pdf
https://hdl.handle.net/11511/20969

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Lane Change Scheduling for Autonomous Vehicles Schmidt, Klaus Verner; Schmidt, Şenan Ece (2016-05-20) The subject of this paper is the coordination of lane changes of autonomous vehicles on a two-lane road segment before reaching a given critical position. We first develop an algorithm that performs a lane change of a single vehicle in the shortest possible time. This algorithm is then applied iteratively in order to handle all lane changes required on the considered road segment while guaranteeing traffic safety. Various example scenarios illustrate the functionality of our algorithm.
Steering strategies for multi-axle vehicles Bayar, Kerem; Ünlüsoy, Yavuz Samim (2008-01-01) The object of this study is to extend 4WS idea to an n-axle vehicle in general and to simulate sonic multi-axle vehicles with the derived strategies in an attempt to determine the best steering strategy. By extending the strategies used for four-wheel steering two-axle vehicles which have been extensively studied in literature, general strategies are established for an n-axle vehicle. Using integrated nonlinear ride and handling models in Matlab & Simulink, it is shown that lateral acceleration and yaw velo...
Trafik Aglarını Bölüntüleyerek Formel Kontrol Stratejilerinin Üretilmesi Bardakci, Kemal Cagri; Aydın Göl, Ebru (2017-06-29) The aim of this paper is to produce control strategies for a large vehicular traffic network model of signalized intersections from Linear Temporal Logic specifications. For this purpose, abstraction and formal control techniques which ensure the correctness of synthesized control strategies are utilized. In addition, in order to solve the scalability problem encountered in formal control of dynamic systems, novel network partitioning methods are developed. The proposed methods guarantee that if each sub-ne...
Lane change scheduling for connected and autonomous vehicles Atagoziev, Maksat; Güran Schmidt, Ece; Schmidt, Klaus Verner (2023-02-01) The execution of lane changes has a strong impact on driving safety and traffic throughput. Therefore, it is highly desired to automate and coordinate lane changes. The subject of this paper is the scheduling of lane changes of a group of connected and autonomous vehicles (CAVs) with the aim of minimizing the time during which all lane changes are completed, while keeping small inter-vehicle distances. To this end, the paper first develops an algorithm for minimizing the lane change time of a single CAV. Th...
Random Sequences in Vehicle Routing Problem Gülşen, Mehmet Emin; Yayla, Oğuz; Department of Cryptography (2022-9-1) Vehicle Routing Problem (VRP) is a classical combinatorial optimization and integer programming problem. The goal of VRP is to find the optimal set of routes to given set of destination points with a fleet of vehicles. In this thesis, we have focused on the a variant of VRP which is Capacitated Vehicle Routing Problem (CVRP) and present two different combination of heuristic algorithms with random projection clustering technique and also provide comparison of random number generators on Monte Carlo Simulati...

Citation Formats

M. Koçak, “Vehicle routing problem in cross dockswith shift-based time constraints on products,” M.S. - Master of Science, Middle East Technical University, 2011.