Access count of this item: 25

Files in This Item:
File Description SizeFormat 
j.sbspro.2010.04.022.pdf238.07 kBAdobe PDFView/Open
Title: Ant colony system based routing and scheduling for hazardous material transportation
Authors: Pradhananga, Rojee
Taniguchi, Eiichi
Yamada, Tadashi  kyouindb  KAKEN_id  orcid https://orcid.org/0009-0005-9937-951X (unconfirmed)
Author's alias: 谷口, 栄一
山田, 忠史
Keywords: Hazardous material
optimisation
vehicle routing problem with time window
ant colony system
Issue Date: 2010
Publisher: Elsevier BV
Journal title: Procedia - Social and Behavioral Sciences
Volume: 2
Issue: 3
Start page: 6097
End page: 6108
Abstract: This paper presents a new meta-heuristic algorithm using an ant colony system (ACS) for multi-objective optimisation of hazardous material (HAZMAT) transportation. We focus on the vehicle routing problem with time windows (VRPTW) aspect of HAZMAT transportation problem. A VRPTW formulation considering multiple attributes in application to HAZMAT transportation is provided. ACS in the proposed algorithm works in the framework of pareto-optimisation for routing and integrates a labelling algorithm for finding non-dominated paths for path choice purpose. Validity of the algorithm has been tested by applying it to several VRPTW benchmark problems. Results show that the proposed algorithm performs quite satisfactorily to the wide variety of VRPTW problems.
Rights: © 2010 Published by Elsevier Ltd.
Open access under CC BY-NC-ND license.
URI: http://hdl.handle.net/2433/290301
DOI(Published Version): 10.1016/j.sbspro.2010.04.022
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


This item is licensed under a Creative Commons License Creative Commons