Please use this identifier to cite or link to this item:
|Title:||A Local Search Technique for Solving a Delivery Problem of Fuel Products||Authors:||
|Issue Date:||2007||Publisher:||University of the Thai Chamber of Commerce||Source:||Suprayogi, Setiawan Komara, Hiroyuki Yamato (2007) A Local Search Technique for Solving a Delivery Problem of Fuel Products.||Conference:||Proceedings of the 2nd International Conference on Operations and Supply Chain Management||Abstract:||
This paper addresses on a delivery problem of fuelproducts, i.e., gasoline, kerosene, and diesel oil, from asupply point to a number of destination points. Thedelivery is performed using tankers having somecompartments. Each compartment is dedicated to a certainfuel product type. A solution of the problem is todetermine a tanker’s routing plan for delivering the fuelproducts in order to fulfill the objective functions with thefollowing priority order: minimizing number of tankers,minimizing total completion time, and minimizing rangeof tour completion time. The routing problem discussed inthis paper is considered as a variant of vehicle routingproblems (VRPs) which has the following characteristics:split delivery, multiple routes (multiple trips), andmultiple products and compartments. A local searchtechnique is proposed as a solution technique for theproblem. The local search technique consists ofmechanisms for generating an initial solution andsearching candidate solutions. The initial solution isgenerated using a sequential insertion algorithm. In thesearching mechanism, relocation and exchange operatorsare used to generate candidate solutions. The solutiontechnique is applied in a numerical example of the fueldelivery problem.
|URI:||https://scholar.utcc.ac.th/handle/6626976254/894||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
checked on Mar 5, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.