The capacitated plant location problem with customers and suppliers matching

被引：18

作者：

Zhu, Zhanguo ^{[1
,2
]}

Chu, Feng ^{[3
]}

Sun, Linyan ^{[1
,4
]}

机构：

[1] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Peoples R China

[2] Univ Technol Troyes, Inst Charles Delaunay, CNRS, FRE 2848,LOSI, F-10010 Troyes, France

[3] Univ Evry Val Essonne, Lab Informat Biol Integrat & Syst Complexes IBISC, CNRS, FRE 3190, F-91020 Evry, France

[4] State Key Lab Mech Mfg Syst Engn, Xian 710049, Peoples R China

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2010年 / 46卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Plant location; Lagrangian relaxation; Matching; Integer linear programming; FACILITY LOCATION; ROUTING PROBLEM; SINGLE-SOURCE; LOWER BOUNDS; TABU SEARCH; ALGORITHM; HEURISTICS; 2-ECHELON; MODELS; SYSTEM;

D O I：

10.1016/j.tre.2009.09.002

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

This paper introduces a new problem called the capacitated plant location problem with customer and supplier matching (CLCSM). The product distribution from plants to customers and the material supply from suppliers to plants are considered together. We merge a distribution trip and a supply trip into one triangular trip for saving allocation cost. Vehicles from plants visit a customer and a supplier for each trip. We provide a heuristic solution procedure based on Lagrangian relaxation. Computational results indicate that the proposed heuristic solution procedure is shown to be efficient yielding optimal or near-optimal solutions for randomly generated instances. (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：469 / 480

页数：12

共 34 条

[1] A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case [J].

Aksen, Deniz ;

Altinkemer, Kemal .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (02) :554-575

[2] Designing a distribution network in a supply chain system: Formulation and efficient solution procedure [J].

Amiri, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (02) :567-576

[3]

[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations

[4] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].

BALINSKI, ML .

MANAGEMENT SCIENCE, 1965, 12 (03) :253-313

[5] Solving a multiobjective location routing problem with a metaheuristic based on tabu search.: Application to a real case in Andalusia [J].

Caballero, Rafael ;

Gonzalez, Mercedes ;

Guerrero, Flor M. ;

Molina, Julian ;

Paralera, Concepcion .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :1751-1763

[6] A COMPARISON OF HEURISTICS AND RELAXATIONS FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].

CORNUEJOLS, G ;

SRIDHARAN, R ;

THIZY, JM .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 50 (03) :280-297

[7] Upper and lower bounds for the single source capacitated location problem [J].

Cortinhal, MJ ;

Captivo, ME .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) :333-351

[8]

EILON S, 1971, DISTRIBUTION MANAGEM

[9] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].

FISHER, ML .

MANAGEMENT SCIENCE, 1981, 27 (01) :1-18

[10]

GAO LL, 1992, NAV RES LOG, V39, P191, DOI 10.1002/1520-6750(199203)39:2<191::AID-NAV3220390205>3.0.CO

← 1 2 3 4 →