article · 2003

Solving a Multicommodity Location-Allocation Problem With

Non Linear Costs, Federico Malucelli, Patrick Soriano, Angel Ruiz, Roberto Wolfler Calvo

Cited by 0Abstract and details only

Abstract

This paper deals with a planning problem arising in large logistics companies. The problem consists in defining the optimal number of depots, their location, and their size as well as the routing decisions. Economies of scale are present both in the transportation and in the depots operations. The paper proposes an exact algorithm and an e#cient heuristic based on the integration of tabu search and variable neighborhood search principles. Computational results obtained with real-life data and randomly generated but realistic instances prove the validity of the approaches.

Cite this paper

APA 7

Costs, N. L., Malucelli, F., Soriano, P., Ruiz, A., & Calvo, R. W. (2003). Solving a Multicommodity Location-Allocation Problem With.

MLA 9

Costs, Non Linear, et al. “Solving a Multicommodity Location-Allocation Problem With.” 2003.

Chicago

Costs, Non Linear, Federico Malucelli, Patrick Soriano, Angel Ruiz, and Roberto Wolfler Calvo. 2003. “Solving a Multicommodity Location-Allocation Problem With.”

Harvard

Costs, N.L. et al. (2003) ‘Solving a Multicommodity Location-Allocation Problem With’.

BibTeX

@article{costs2003solving,
  title = {{Solving a Multicommodity Location-Allocation Problem With}},
  author = {Costs, Non Linear and Malucelli, Federico and Soriano, Patrick and Ruiz, Angel and Calvo, Roberto Wolfler},
  year = {2003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.