Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/839
Title: SOLUTION APPROACHES FOR MIXED PALLET COLLECTION PROBLEM: A CASE STUDY IN A LOGISTIC COMPANY
Authors: Kesen, Saadettin Erhan
Alim, Muzaffer
Keywords: Vehicle Routing Problem
Clarke And Wright Saving Algorithm
Simulated Annealing
Vehicle-Routing Problem
Simultaneous Delivery
Optimization
Heuristics
Algorithm
Issue Date: 2019
Publisher: YILDIZ TECHNICAL UNIV
Abstract: In this paper, we study a mixed pallet collection problem in a warehouse of the company operating in fast moving consumer goods industry and present a mixed integer programming formulation with the objective function of total travelling distance minimization. The problem studied is shown to be equivalent to the well-known vehicle routing problem. Since the problem belongs to the class of NP-hard problems, introduced mathematical formulation cannot provide optimal solution in an acceptable amount of time. We, therefore, develop an algorithm based on Simulated Annealing (SA) meta-heuristic approach to find near-optimal solution in a quite shorter computational time. Routes are constructed using Clarke&Wright saving algorithm and then these routes are perturbed whereby three neighborhood operators, namely swap, insert, swap-range are utilized to further improve the quality of the solution. Experimental results based on a real case instance demonstrates that SA algorithm is capable of providing solution more quickly than that of CPLEX solver but the quality of the solution found by SA is 7% worse than that of CPLEX.
URI: https://hdl.handle.net/20.500.13091/839
ISSN: 1304-7205
1304-7191
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections

Show full item record

CORE Recommender

WEB OF SCIENCETM
Citations

3
checked on Dec 23, 2022

Page view(s)

40
checked on Jan 23, 2023

Google ScholarTM

Check


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.