Solving a bi-objective mathematical programming model for bloodmobiles location routing problem

To identify the impact of low-carbon policies on the location-routing problem (LRP) with cargo splitting (LRPCS), this paper first constructs the bi-level programming model of LRPCS. On this basis, the bi-level programming models of LRPCS under four low-carbon policies are constructed, respectively. The upper-level model takes the engineering construction department as the decision-maker to decide on the distribution center’s location. The lower-level model takes the logistics and distribution department as the decision-maker to make decisions on the vehicle distribution route’s scheme. Secondly, the hybrid algorithm of Ant Colony Optimization and Tabu Search (ACO-TS) is designed, and an example is introduced to verify the model’s and algorithm’s effectiveness. Finally, multiple sets of experiments are designed to explore the impact of various low-carbon policies on the decision-making of the LRPCS. The experimental results show that the influence of the carbon tax policy is the greatest, the carbon trading and carbon offset policy have a certain impact on the decision-making of the LRPCS, and the influence of the emission cap policy is the least. Based on this, we provide the relevant low-carbon policies advice and management implications.

Download Full-text

A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

Discrete Dynamics in Nature and Society ◽

10.1155/2016/3475369 ◽

2016 ◽

Vol 2016 ◽

pp. 1-18 ◽

Cited By ~ 3

Author(s):

Qunli Yuchi ◽

Zhengwen He ◽

Zhen Yang ◽

Nengmin Wang

Keyword(s):

Network Design ◽

Programming Model ◽

Optimal Solution ◽

Nonlinear Integer Programming ◽

Inventory Routing ◽

Distribution Centers ◽

Location Routing Problem ◽

Routing Problem ◽

Location Routing ◽

Reverse Logistic

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.

Download Full-text

Formulation and a heuristic approach for the Orienteering Location-Routing Problem

RAIRO - Operations Research ◽

10.1051/ro/2020058 ◽

2020 ◽

Author(s):

Ali Nadizadeh

Keyword(s):

Programming Model ◽

Standard Test ◽

Test Problems ◽

Military Operations ◽

Location Routing Problem ◽

Routing Problem ◽

Practical Applications ◽

Location Routing ◽

Commercial Solver ◽

Short Time

In this paper, a new version of the location-routing problem (LRP), named orienteering location-routing problem (OLRP) is investigated. The problem is composed of two-well known problems: team orienteering problem (TOP) and LRP. There are some challenging practical applications in logistics, tourism, military operations, and other fields, which can be modeled by OLRP. The problem is to consider the location and routing with a special objective function . In the OLRP, a set of nodes with specific scores is given, and some stations among candidate stations should be established. Moreover, there are some routes limited in length, which start from a station, visit some nodes and then return to the same station. Maximizing the sum of the collected scores is the goal of OLRP. To model the problem, an integer linear programming model is proposed. Against a commercial solver, a heuristic GRASP is developed for solving the standard test problems. Most test problems are found difficult to solve optimally with commercial software while the GRASP can find the best known or close to the best-known solution in a short time .

Download Full-text

Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance and Reconnaissance

10.20944/preprints201809.0487.v1 ◽

2018 ◽

Author(s):

Yao Liu ◽

Zhong Liu ◽

Jianmai Shi ◽

Guohua Wu ◽

Chao Chen

Keyword(s):

Unmanned Aerial Vehicles ◽

Heuristic Algorithms ◽

Programming Model ◽

Base Station ◽

Base Stations ◽

Location Routing Problem ◽

Routing Problem ◽

Solution Approach ◽

Location Routing ◽

Aerial Vehicles

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

Download Full-text

A mixed integer linear programming model for designing a green closed-loop supply chain network considering location-routing problem

International Journal of Logistics Systems and Management ◽

10.1504/ijlsm.2020.10019491 ◽

2020 ◽

Vol 35 (1) ◽

pp. 1 ◽

Cited By ~ 1

Author(s):

Alvand Sadeghi ◽

Hassan Mina ◽

Niloofar Bahrami

Keyword(s):

Linear Programming ◽

Mixed Integer Linear Programming ◽

Closed Loop ◽

Programming Model ◽

Mixed Integer ◽

Supply Chain Network ◽

Location Routing Problem ◽

Routing Problem ◽

Integer Linear Programming Model ◽

Location Routing

Download Full-text

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Mathematical Problems in Engineering ◽

10.1155/2015/525980 ◽

2015 ◽

Vol 2015 ◽

pp. 1-11 ◽

Cited By ~ 2

Author(s):

Ji Ung Sun

Keyword(s):

Evolutionary Algorithm ◽

Vehicle Routing ◽

Solution Method ◽

Programming Model ◽

Mixed Integer ◽

Hub Location ◽

Hub Location Problem ◽

Location Routing Problem ◽

Routing Problem ◽

Location Routing

We consider a capacitated hub location-routing problem (HLRP) which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitatedp-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA) which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

Download Full-text

Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance and Reconnaissance

10.20944/preprints201809.0487.v2 ◽

2019 ◽

Author(s):

Yao Liu ◽

Zhong Liu ◽

Jianmai Shi ◽

Guohua Wu ◽

Chao Chen

Keyword(s):

Unmanned Aerial Vehicles ◽

Heuristic Algorithms ◽

Programming Model ◽

Base Station ◽

Base Stations ◽

Location Routing Problem ◽

Routing Problem ◽

Solution Approach ◽

Location Routing ◽

Aerial Vehicles

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

Download Full-text