NDLI: Multi-objective two-depot traveling salesman problem with uncertain fleet size for hazardous materials

Content Provider	IEEE Xplore Digital Library
Author	Huiling Zhong Nan Zhuang Wenxue Cai Guanxiang Zhang Zongkun Wu
Copyright Year	2010
Description	Author affiliation: Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China (Zongkun Wu) \|\| Sch. of Econ. & Commerce, South China Univ. of Technol., Guangzhou, China (Huiling Zhong; Nan Zhuang; Wenxue Cai; Guanxiang Zhang)
Abstract	This paper proposes a multi-objective two-depot traveling salesman problem with uncertain fleet size (MTTSP), which determines optimal distribution route for hazardous materials (hazmat). It actually aims to identify nondominated paths from two given depots to some given destinations under the premise of minimizing the number of mix trucks, that is, deploy as few resources as possible to meet the need effectively and efficiently. An effective genetic algorithm based on ranking is then developed. In addition, a case study is carried out to demonstrate the methodology proposed in this paper.
Starting Page	1
Ending Page	8
File Size	308709
Page Count	8
File Format	PDF
ISBN	9789623676960
e-ISBN	9789623676960
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-06
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Hong Kong Polytechnic Uni
Subject Keyword	Hazardous materials Multi-objective two-depot traveling salesman problem Hazardous materials (hazmat) Genetic algorithm Transportation Uncertain fleet size Traveling salesman problems Routing Classification algorithms Biological cells Petroleum Mix vehicles
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem

Study on Hybrid Genetic Algorithm for Multi-type Vehicles and Multi-depot Vehicle Routing Problem with Backhauls

Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation

An Improved Pareto Genetic Algorithm for Multi-objective TSP

A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem

A transformation for a Multiple Depot, Multiple Traveling Salesman Problem

An efficient and scalable algorithm for the traveling salesman problem

A heuristic modification of genetic algorithm used for solving the single depot capacited vehicle routing problem

A high performance hybrid metaheuristic for traveling saleswman problem

Multi-objective two-depot traveling salesman problem with uncertain fleet size for hazardous materials

Similar Documents

An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem

Study on Hybrid Genetic Algorithm for Multi-type Vehicles and Multi-depot Vehicle Routing Problem with Backhauls

Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation

An Improved Pareto Genetic Algorithm for Multi-objective TSP

A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem

A transformation for a Multiple Depot, Multiple Traveling Salesman Problem

An efficient and scalable algorithm for the traveling salesman problem

A heuristic modification of genetic algorithm used for solving the single depot capacited vehicle routing problem

A high performance hybrid metaheuristic for traveling saleswman problem

Multi-objective two-depot traveling salesman problem with uncertain fleet size for hazardous materials