scholarly journals A Hyperheuristic Approach for Location-Routing Problem of Cold Chain Logistics considering Fuel Consumption

2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Zheng Wang ◽  
Longlong Leng ◽  
Shun Wang ◽  
Gongfa Li ◽  
Yanwei Zhao
Keyword(s):  
Fuel Consumption ◽  
Time Window ◽  
Market Competition ◽  
Solution Set ◽  
Environmental Benefits ◽  
Cold Chain ◽  
Nsga Ii ◽  
Pareto Solution ◽  
Total Cost ◽  
Location Routing

In response to violent market competition and demand for low-carbon economy, cold chain logistics companies have to pay attention to customer satisfaction and carbon emission for better development. In this paper, a biobjective mathematical model is established for cold chain logistics network in consideration of economic, social, and environmental benefits; in other words, the total cost and distribution period of cold chain logistics are optimized, while the total cost consists of cargo damage cost, refrigeration cost of refrigeration equipment, transportation cost, fuel consumption cost, penalty cost of time window, and operation cost of distribution centres. One multiobjective hyperheuristic optimization framework is proposed to address this multiobjective problem. In the framework, four selection strategies and four acceptance criteria for solution set are proposed to improve the performance of the multiobjective hyperheuristic framework. As known from a comparative study, the proposed algorithm had better overall performance than NSGA-II. Furthermore, instances of cold chain logistics are modelled and solved, and the resulting Pareto solution set offers diverse options for a decision maker to select an appropriate cold chain logistics distribution network in the interest of the logistics company.

scholarly journals Model and Algorithm of Two-Stage Distribution Location Routing with Hard Time Window for City Cold-Chain Logistics

2020 ◽  
Vol 10 (7) ◽  
pp. 2564
Author(s):  
Liying Yan ◽  
Manel Grifoll ◽  
Pengjun Zheng
Keyword(s):  
Time Window ◽  
Hybrid Genetic Algorithm ◽  
Distribution Networks ◽  
Cold Chain ◽  
Two Stage ◽  
Logistics Network ◽  
Stage Distribution ◽  
Hard Time ◽  
Location Routing ◽  
Logistics Enterprises

Taking cold-chain logistics as the research background and combining with the overall optimisation of logistics distribution networks, we develop two-stage distribution location-routing model with the minimum total cost as the objective function and varying vehicle capacity in different delivery stages. A hybrid genetic algorithm is designed based on coupling and collaboration of the two-stage routing and transfer stations. The validity and feasibility of the model and algorithm are verified by conducting a randomly generated test. The optimal solutions for different objective functions of two-stage distribution location-routing are compared and analysed. Results turn out that for different distribution objectives, different distribution schemes should be employed. Finally, we compare the two-stage distribution location-routing to single-stage vehicle routing problems. It is found that a two-stage distribution location-routing system is feasible and effective for the cold-chain logistics network, and can decrease distribution cost for cold-chain logistics enterprises.

scholarly journals Shared Mechanism-Based Self-Adaptive Hyperheuristic for Regional Low-Carbon Location-Routing Problem with Time Windows

2018 ◽  
Vol 2018 ◽  
pp. 1-21 ◽  
Author(s):  
Longlong Leng ◽  
Yanwei Zhao ◽  
Zheng Wang ◽  
Hongwei Wang ◽  
Jingling Zhang
Keyword(s):  
Fuel Consumption ◽  
Carbon Emission ◽  
Time Windows ◽  
Travel Distance ◽  
Low Carbon ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Total Cost ◽  
Location Routing ◽  
Self Adaptive

In this paper, we consider a variant of the location-routing problem (LRP), namely, the regional low-carbon LRP with reality constraint conditions (RLCLRPRCC), which is characterized by clients and depots that located in nested zones with different speed limits. The RLCLRPRCC aims at reducing the logistics total cost and carbon emission and improving clients satisfactory by replacing the travel distance/time with fuel consumption and carbon emission costs under considering heterogeneous fleet, simultaneous pickup and delivery, and hard time windows. Aiming at this project, a novel approach is proposed: hyperheuristic (HH), which manipulates the space, consisted of a fixed pool of simple operators such as “shift” and “swap” for directly modifying the space of solutions. In proposed framework of HH, a kind of shared mechanism-based self-adaptive selection strategy and self-adaptive acceptance criterion are developed to improve its performance, accelerate convergence, and improve algorithm accuracy. The results show that the proposed HH effectively solves LRP/LRPSPD/RLCLRPRCC within reasonable computing time and the proposed mathematical model can reduce 2.6% logistics total cost, 27.6% carbon emission/fuel consumption, and 13.6% travel distance. Additionally, several managerial insights are presented for logistics enterprises to plan and design the distribution network by extensively analyzing the effects of various problem parameters such as depot cost and location, clients’ distribution, heterogeneous vehicles, and time windows allowance, on the key performance indicators, including fuel consumption, carbon emissions, operational costs, travel distance, and time.

scholarly journals Green routing in a two-level network of cross docks given the shipping price (Case study: Pegah Co.)

2021 ◽  
Vol 9 ◽  
Author(s):  
Farhad Bavar ◽  
◽  
Majid Sabzehparvar ◽  
Mona Ahmadi Rad ◽  
◽  
...  
Keyword(s):  
Cost Reduction ◽  
High Performance ◽  
Time Window ◽  
Distribution Network ◽  
Environmental Pollutants ◽  
Nsga Ii ◽  
Total Cost ◽  
Green Routing ◽  
Carbon Emissions Reduction

In this study, a green routing model is provided in a two-level network of cross docking given the shipping price. Three objectives were proposed in this model including: total cost reduction, shipping costs reduction and carbon emissions reduction. The overall objective of the model, is getting the best route in the distribution network which will impose the least cost and also minimizes emissions of environmental pollutants. For the model to approach the real situation, Pegah corporation’s warehouses and distribution network are considered as a case study. Solving the developed model was carried out by GAMS. By the size of the problem increasing, the running time of the program is notably increased and this means the problem is np-hard. So, in order to solve the model in medium and large dimensions, we used meta-heuristic MOGWO and NSGA II algorithm. The results of investigating various problems with meta-heuristics, indicates the high performance of the proposed algorithm in terms of the time needed and the response achieved. Results indicated that the proposed model reduced the emission of environmental pollutants along with total cost and shipping cost reduction. Also given the time window, the products were shipped to customers in a timely manner.

scholarly journals Multi-objective Optimization for Location-Routing-Inventory Problem in Cold Chain Logistics Network with Soft Time Window Constraint

2020 ◽  
Vol 53 (6) ◽  
pp. 803-809
Author(s):  
Kang Li ◽  
Dan Li ◽  
Daqing Wu
Keyword(s):  
Time Window ◽  
Model Simulation ◽  
Transportation Cost ◽  
Cold Chain ◽  
Inventory Problem ◽  
Penalty Cost ◽  
Logistics Network ◽  
Multi Objective ◽  
Location Routing ◽  
Improve Service Quality

With the improvement of enterprise services, location-routing-inventory problem with time window constraint (LRIPTW) has become an essential problem in cold chain logistics network (CCLN). This paper aims to optimize the location cost, inventory cost, transportation cost, and penalty cost in CCLN simultaneously. Firstly, an optimization model was established for the LRIP with soft time window constraint (STW). Then, the multi-objective ant colony optimization (MACO) was improved to solve the model. Simulation results show that the improved MACO can solve the LRIPSTW effectively and efficiently. The research findings provide a reference for enterprises to reduce total cost and improve service quality.

scholarly journals The Location-Routing Problem with Full Truckloads in Low-Carbon Supply Chain Network Designing

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Cheng Chen ◽  
Rongzu Qiu ◽  
Xisheng Hu
Keyword(s):  
Supply Chain ◽  
Hybrid Approach ◽  
Supply Chain Network ◽  
Low Carbon ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Total Cost ◽  
Carbon Supply ◽  
Location Routing

In recent years, low-carbon supply chain network design has been the focus of studies as the development of low-carbon economy. The location-routing problem with full truckloads (LRPFT) is investigated in this paper, which extends the existing studies on the LRP to full truckloads problem within the regional many-to-many raw material supply network. A mathematical model with dual objectives of minimizing total cost and environmental effects simultaneously is developed to determine the number and locations of facilities and optimize the flows among different kinds of nodes and routes of trucks as well. A novel multiobjective hybrid approach named NSGA-II-TS is proposed by combining a known multiobjective algorithm, NSGA-II, and a known heuristics, Tabu Search (TS). A chromosome presentation based on natural number and modified partially mapping crossover operator for the LRPFT are designed. Finally, the computational effectiveness of the hybrid approach is validated by the numerical results and a practical case study is applied to demonstrate the tradeoff between total cost and CO2 emission in the LRPFT.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

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.

scholarly journals Analysis and optimization of the vehicle handling stability with considering suspension kinematics and compliance characteristics

2021 ◽  
Vol 13 (5) ◽  
pp. 168781402110155
Author(s):  
Jin Gao ◽  
Fuquan Wu
Keyword(s):  
Dynamic Model ◽  
Great Influence ◽  
Transient State ◽  
Transient Characteristic ◽  
Nsga Ii ◽  
Pareto Solution ◽  
Characteristic Index ◽  
Yaw Rate ◽  
Comparison Results ◽  
Force Calculation

The dynamic model of the front double wishbone suspension and the rear multi-link suspension of the vehicle are established. On the basis of detailed analysis of suspension kinematics, calculation method of wheel alignment angle and force calculation of suspension bushing, the influence mechanism of suspension bushing on the vehicle transient state is clarified, and the vehicle transient characteristic index is derived from the vehicle three-free dynamic model. The sensitivity analysis of the suspension bushing is carried out, and the bushing stiffness which has a great influence on the transient state of the vehicle is obtained. The bushing stiffness scale factor is used as the optimization variable, the vehicle transient characteristic index is used as the optimization target, and the NSGA-II optimization algorithm is used for multi-objective optimization. After optimization, one Pareto solution is selected to compare with the original vehicle, the comparison results show that the yaw rate gain, resonance frequency and delay time of yaw rate in the vehicle transient characteristic index are all improved, other optimization targets change less. In the steady-state comparison, the understeer tendency of the vehicle increases, and the roll angle of the vehicle increases but is within an acceptable range.

scholarly journals Structure of Pareto Solutions of Generalized Polyhedral-Valued Vector Optimization Problems in Banach Spaces

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Qinghai He ◽  
Weili Kong
Keyword(s):  
Banach Spaces ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Solution Set ◽  
Pareto Optimal ◽  
Pareto Solution ◽  
Value Set ◽  
Set Valued Mapping ◽  
Optimal Value

In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra. Dropping the compactness assumption, we establish some results on structure of the weak Pareto solution set, Pareto solution set, weak Pareto optimal value set, and Pareto optimal value set of (SVOP) and on connectedness of Pareto solution set and Pareto optimal value set of (SVOP). In particular, we improved and generalize, Arrow, Barankin, and Blackwell’s classical results in Euclidean spaces and Zheng and Yang’s results in general Banach spaces.

Influences of vehicles’ fuel consumption and exhaust emissions on the trip cost without late arrival under car-following model

2016 ◽  
Vol 27 (01) ◽  
pp. 1650011 ◽  
Author(s):  
Tie-Qiao Tang ◽  
Qiang Yu
Keyword(s):  
Fuel Consumption ◽  
Exhaust Emissions ◽  
Optimal Time ◽  
Fuel Cost ◽  
Total Cost ◽  
Car Following ◽  
Time Headway ◽  
Late Arrival ◽  
Car Following Model ◽  
Open Road

In this paper, we use car-following model to explore the influences of the vehicle’s fuel consumption and exhaust emissions on each commuter’s trip cost without late arrival on one open road. Our results illustrate that considering the vehicle’s fuel cost and emission cost only enhances each commuter’s trip cost and the system’s total cost, but has no prominent impacts on his optimal time headway at the origin of each open road under the minimum total cost.

scholarly journals An evaluation of three DoE-guided meta-heuristic-based solution methods for a three-echelon sustainable distribution network

2020 ◽  
Vol 296 (1-2) ◽  
pp. 421-469
Author(s):  
Sahar Validi ◽  
Arijit Bhattacharya ◽  
P. J. Byrne
Keyword(s):  
Distribution Network ◽  
Np Hard ◽  
Nsga Ii ◽  
Solution Approach ◽  
Logistics Network ◽  
Location Routing ◽  
Solution Methods ◽  
Order Preference ◽  
Operational Constraints ◽  
Transportation Routes

AbstractThis article evaluates the efficiency of three meta-heuristic optimiser (viz. MOGA-II, MOPSO and NSGA-II)-based solution methods for designing a sustainable three-echelon distribution network. The distribution network employs a bi-objective location-routing model. Due to the mathematically NP-hard nature of the model a multi-disciplinary optimisation commercial platform, modeFRONTIER®, is adopted to utilise the solution methods. The proposed Design of Experiment (DoE)-guided solution methods are of two phased that solve the NP-hard model to attain minimal total costs and total CO2 emission from transportation. Convergence of the optimisers are tested and compared. Ranking of the realistic results are examined using Pareto frontiers and the Technique for Order Preference by Similarity to Ideal Solution approach, followed by determination of the optimal transportation routes. A case of an Irish dairy processing industry’s three-echelon logistics network is considered to validate the solution methods. The results obtained through the proposed methods provide information on open/closed distribution centres (DCs), vehicle routing patterns connecting plants to DCs, open DCs to retailers and retailers to retailers, and number of trucks required in each route to transport the products. It is found that the DoE-guided NSGA-II optimiser based solution is more efficient when compared with the DoE-guided MOGA-II and MOPSO optimiser based solution methods in solving the bi-objective NP-hard three-echelon sustainable model. This efficient solution method enable managers to structure the physical distribution network on the demand side of a logistics network, minimising total cost and total CO2 emission from transportation while satisfying all operational constraints.

Sign in / Sign up

Export Citation Format

Share Document