Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path | Zendy

Igor Averbakh | Zendy; Oded Berman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

Author(s) -

Igor Averbakh,

Oded Berman

Publication year - 1994

Publication title -

transportation science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.965

H-Index - 115

eISSN - 1526-5447

pISSN - 0041-1655

DOI - 10.1287/trsc.28.2.162

Subject(s) - routing (electronic design automation) , equal cost multi path routing , computer science , static routing , destination sequenced distance vector routing , computer network , travelling salesman problem , path (computing) , policy based routing , multipath routing , link state routing protocol , dynamic source routing , geographic routing , mathematical optimization , routing protocol , mathematics , algorithm

In this note, we discuss routing and location-routing delivery men problems on a path. The objective of the delivery men problem is to find service tours so as to minimize the total waiting time of all customers. We present an O ( n 2 ) time algorithm for the location-routing problem with a single server. This algorithm is further used in polynomial time algorithms that are developed for routing and location-routing problems with p servers. Also considered is the sales-delivery men problem for which in addition to the delivery men criterion, also the traveling salesman criterion (which is of primary importance) is used.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research