Please use this identifier to cite or link to this item:
|Title:||A Max Min Ant System for Multi-Depot Routing Problem||Authors:||Sodsoon, Suphan
|Issue Date:||2007||Publisher:||University of the Thai Chamber of Commerce||Source:||Suphan Sodsoon, Sombat Sindhuchao (2007) A Max Min Ant System for Multi-Depot Routing Problem.||Conference:||Proceedings of the 2nd International Conference on Operations and Supply Chain Management||Abstract:||This work introduces a modified MAX MIN ant system(MMAS) designed to solve the Multi-Depot Routingproblem (MDVRP). It presents the most relevant stepstowards the implementation of an MMAS to solve theMDVRP, involving servicing a set of customers from aset of specific capacitated depots using a set of identicalvehicles with limited capacity. The objective of theproblem is to minimize the total cost/distance of systemconsisting of multi depots and multi customers. SinceMDVRP is an NP-hard combinatorial problem, theheuristic is an appropriate approach to solve thisproblem.In this study, the proposed heuristic is based on MMASwith the MDVRP. In addition, the 2–opt heuristic isutilized to improve each vehicle tour. This approachaims to integrate two levels of decision making(Location-Routing) in a computationally efficientmanner. Simulations are performed using probleminstances available from Or-Library. The results showedthat the modified MMAS performs efficiently in solvingMDVRP.||URI:||https://scholar.utcc.ac.th/handle/6626976254/898||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||conference_item|
Show full item record Recommend this item
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.