Comparing assignment algorithms for the Multi-Depot VRP

This paper considers the Multi-Depot Vehicle Routing Problem (MDVRP). Given the intrinsic difficulty of this problem class, approximation methods of the type "cluster first, route second" (two step approaches) seem to be promising for practical size problems. The first step, clustering is usually so...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолч:	Tansini, Libertad (author)
Бусад зохиолчид:	Urquhart, María E. (author), Viera, Omar (author)
Формат:	report
Хэвлэсэн:	2001
Нөхцлүүд:	MULTI-DEPOT VEHICLE ROUTING PROBLEM TRANSPORT PROBLEM PROBLEMAS DEL TRANSPORTE CLUSTERING RUTEO DE VEHICULOS
Онлайн хандалт:	http://hdl.handle.net/20.500.12008/3478
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!