Pickup and delivery vehicle routing with multidimensional loading constraints

In this paper we introduce a new, pickup and delivery vehicle routing model where weight limits and also packing constraints are taken into account. In the model the vehicles have to transport 3-dimensional boxes from their pickup points into their delivery points. The boxes have weights and the veh...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Bartók Tamás
Imreh Csanád
Testületi szerző: Conference for PhD Students in Computer Science (7.) (2010) (Szeged)
Dokumentumtípus: Cikk
Megjelent: 2011
Sorozat:Acta cybernetica 20 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
doi:10.14232/actacyb.20.1.2011.3

Online Access:http://acta.bibl.u-szeged.hu/12896
LEADER 01397nab a2200253 i 4500
001 acta12896
005 20220617132743.0
008 161015s2011 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.20.1.2011.3  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Bartók Tamás 
245 1 0 |a Pickup and delivery vehicle routing with multidimensional loading constraints  |h [elektronikus dokumentum] /  |c  Bartók Tamás 
260 |c 2011 
300 |a 17-33 
490 0 |a Acta cybernetica  |v 20 No. 1 
520 3 |a In this paper we introduce a new, pickup and delivery vehicle routing model where weight limits and also packing constraints are taken into account. In the model the vehicles have to transport 3-dimensional boxes from their pickup points into their delivery points. The boxes have weights and the vehicle has to satisfy a weight limit. We present a heuristic algorithm for the solution of the problem. The efficiency of the algorithm is evaluated by an experimental analysis. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
700 0 1 |a Imreh Csanád  |e aut 
710 |a Conference for PhD Students in Computer Science (7.) (2010) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12896/1/actacyb_20_1_2011_3.pdf  |z Dokumentum-elérés