A hybrid algorithm for solving a bilevel production-distribution planning problem

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses a hierarchical production-distribution system with two levels of decision making. At the top of the hierarchy, a distribution company faces a multi-depot vehicle routing problem, i.e. it decides on the allocation of retailers to depots and on the routes of vehicles from each depot. At the bottom of the hierarchy, a manufacturing company, after receiving the order from the distribution company, decides which manufacturing plants will produce the required items. We present a hybrid algorithm to solve this problem. This algorithm uses the genetic algorithm structure to control the allocation of retailers to depots. It determines the routes to serve retailers by using an ant colony optimization algorithm and addresses the production issue by solving a linear programming problem. The efficiency of the algorithm is shown by applying it to a realistic instance.

Cite

CITATION STYLE

APA

Calvete, H. I., Galé, C., & Oliveros, M. J. (2013). A hybrid algorithm for solving a bilevel production-distribution planning problem. In Lecture Notes in Business Information Processing (Vol. 145, pp. 138–144). Springer Verlag. https://doi.org/10.1007/978-3-642-38279-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free