Three-dimensional one-to-one pickup and delivery  routing problem with loading constraints

Публікація:
Three-dimensional one-to-one pickup and delivery routing problem with loading constraints

dc.contributor.author	Grebennik, I.
dc.contributor.author	Lytvynenko, O.
dc.contributor.author	Baranov, O.
dc.contributor.author	Dupas, R.
dc.date.accessioned	2017-06-08T16:09:00Z
dc.date.available	2017-06-08T16:09:00Z
dc.date.issued	2016
dc.description.abstract	We propose mathematical model and solving strategy for PDP with 3D loading constraints in terms of combinatorial configuration instead of traditional approach that uses boolean variables. We solve traditional one-to-one Pickup and Delivery Problem in combination with problem of packing delivered items into vehicles by means of proposed combinatorial generation algorithm.	uk_UA
dc.identifier.citation	Grebennik Igor / Igor Grebennik, Oleksandr Lytvynenko, Oleksij Baranov, Remy Dupas // Information Systems, Logistics and Supply Chain Conference (ILS 2016): 6th International Conference, June 1 – 4, 2016: Abstract Book. – University of Bordeaux, France, 2016.	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/3806
dc.language.iso	en	uk_UA
dc.subject	Pickup and Delivery problem, loading constraints, combinatorial generation, packing of parallelepipeds.	uk_UA
dc.title	Three-dimensional one-to-one pickup and delivery routing problem with loading constraints	uk_UA
dc.type	Thesis	uk_UA
dspace.entity.type	Publication