Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Genetic algorithms in the design of complex distribution networks

Genetic algorithms in the design of complex distribution networks Reviews the value of network concepts as a means of portraying complex logistics and distribution systems. Reports on research which focuses on the broader issues of model formulation and solution techniques rather than specific applications. Addresses the issues of designing networks with a tree structure, and also more general ones in which loops are allowed and redundancy enforced. The decision variables involved are related to whether or not a link should exist between two specific pairs of nodes, and then what should be the level of traffic flow on that particular link. Describes the design problem in detail and possible models that could be used to represent it. Follows with a description of genetic algorithms to solve the synthesis problem of deciding the node‐link topology, and the use of linear and non‐linear programming to solve the problem of assigning traffic flow to a network with a given typology in a least‐cost manner. Concludes with a description of computational experience with solving such problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Physical Distribution & Logistics Management Emerald Publishing

Loading next page...
 
/lp/emerald-publishing/genetic-algorithms-in-the-design-of-complex-distribution-networks-OPoveEleeK

References (5)

Publisher
Emerald Publishing
Copyright
Copyright © 1998 MCB UP Ltd. All rights reserved.
ISSN
0960-0035
DOI
10.1108/09600039810234924
Publisher site
See Article on Publisher Site

Abstract

Reviews the value of network concepts as a means of portraying complex logistics and distribution systems. Reports on research which focuses on the broader issues of model formulation and solution techniques rather than specific applications. Addresses the issues of designing networks with a tree structure, and also more general ones in which loops are allowed and redundancy enforced. The decision variables involved are related to whether or not a link should exist between two specific pairs of nodes, and then what should be the level of traffic flow on that particular link. Describes the design problem in detail and possible models that could be used to represent it. Follows with a description of genetic algorithms to solve the synthesis problem of deciding the node‐link topology, and the use of linear and non‐linear programming to solve the problem of assigning traffic flow to a network with a given typology in a least‐cost manner. Concludes with a description of computational experience with solving such problems.

Journal

International Journal of Physical Distribution & Logistics ManagementEmerald Publishing

Published: Jul 1, 1998

Keywords: Algorithms; Distribution requirements planning; Distribution systems; Problem solving; Optimization

There are no references for this article.