UNDIRECTED CAPACITATED ARC ROUTING PROBLEM IN DEBRIS COLLECTION OPERATION AFTER DISASTERS
نویسندگان
چکیده
منابع مشابه
Undirected Capacitated Arc Routing Problems in Debris Collection Operation After Disaster
1Dept. of Urban Management, Kyoto University (C1-2-334 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 2Professor, Dept. of Urban Management, Kyoto University (C1-2-335 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 3Lecturer, Dept. of Urban Management, Kyoto University ...
متن کاملMultiobjective Capacitated Arc Routing Problem
The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. A bi-objective genetic algorithm is presented for this more realistic CARP, never studied bef...
متن کاملThe Capacitated Arc Routing Problem: Lower bounds
1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...
متن کاملThe Open Capacitated Arc Routing Problem
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with positive demand under capacity constraints. This problem is related to the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not consider a depot, and...
متن کاملSolving the Undirected Capacitated Arc Routing Problem with a memory based Method
In the capacitated arc routing problem (CARP) there is a network of streets, and on a subset of streets we have to make services (e.g. winter gritting, litter collection, school bus scheduling). A fleet of identical vehicles of limited capacity provides services; the fleet is based at a depot and each trip starts and ends at the depot. Each street can be traversed any number of times, with a kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management)
سال: 2012
ISSN: 2185-6540,2185-6540
DOI: 10.2208/jscejipm.68.i_805