The collection depots location problem on networks Journal Articles

abstract

• AbstractIn this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000

authors

• Berman, Oded
• Drezner, Zvi
• Wesolowsky, George

status

• published 

publication date

• February 2002

has subject area

• 0102 Applied Mathematics (FoR)
• 0103 Numerical and Computational Mathematics (FoR)
• 1503 Business and Management (FoR)
• Logistics & Transportation (Science Metrix)

published in

• Naval Research Logistics  Journal

keywords

• Operations Research & Management Science
• Science & Technology
• Technology

Digital Object Identifier (DOI)

• 10.1002/nav.10000

start page

• 15

end page

• 24

volume

• 49

issue

• 1