Reverse logistic networks optimization of home appliances return based on combined location routing problem

2013 ◽  
Vol 32 (9) ◽  
pp. 2652-2655
Author(s):  
Jun ZHANG
2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Qunli Yuchi ◽  
Zhengwen He ◽  
Zhen Yang ◽  
Nengmin Wang

We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL) network design, which simultaneously integrates the location decisions of distribution centers (DCs), the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered) between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS) algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.


2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.


Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 45
Author(s):  
Rafael D. Tordecilla ◽  
Pedro J. Copado-Méndez ◽  
Javier Panadero ◽  
Carlos L. Quintero-Araujo ◽  
Jairo R. Montoya-Torres ◽  
...  

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.


Author(s):  
Hossein Beiki ◽  
Seyed M. Seyedhosseini ◽  
Leonardus W. W. Mihardjo ◽  
Seyed M. Seyedaliakbar

Author(s):  
Hu Qin ◽  
Xinxin Su ◽  
Teng Ren ◽  
Zhixing Luo

AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.


1997 ◽  
Vol 1602 (1) ◽  
pp. 101-109 ◽  
Author(s):  
João Coutinho-Rodrigues ◽  
John Current ◽  
João Climaco ◽  
Samuel Ratick

Hazardous materials (hazmat) logistics management has received increased attention in the past two decades. Important decisions in such management include the selection of sites for hazmat processing and storage, the selection of transportation routes from sources to processing facilities, and the determination of quantities of hazmat shipped over these routes. These decisions are frequently based on multiple criteria (e.g., cost, risk, equity). A personal computer–based, interactive spatial decision-support system was designed to assist decision makers with such problems. Although presented within the framework of a hazmat problem, the system’s components can be modified to analyse any multiobjective location, routing, or location-routing problem.


Sign in / Sign up

Export Citation Format

Share Document