scholarly journals An Improved Differential Evolution Algorithm for a Multicommodity Location-Inventory Problem with False Failure Returns

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Congdong Li ◽  
Hao Guo ◽  
Ying Zhang ◽  
Shuai Deng ◽  
Yu Wang

Customer returns are a common phenomenon in many industries, and they have a significant impact on business organizations and their supply chains. False failure returns are returned products that have no functional or cosmetic defects, and they represent a large body of customer returns in practice. In this paper, we develop a mixed-integer nonlinear programming model to study a multicommodity location-inventory problem in a forward-reverse logistics network. This model minimizes the total cost in this network by considering false failure returns, and it also considers many real-world business scenarios in forward and reverse logistics flows. Moreover, we design a new heuristic approach to solve the model efficiently. Finally, numerical experiments are conducted to validate our solution approach and provide meaningful managerial insights.

2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Yan Wu ◽  
Tianqi Xia ◽  
Adam Jatowt ◽  
Haoran Zhang ◽  
Xiao Feng ◽  
...  

Abstract Background Heatstroke is becoming an increasingly serious threat to outdoor activities, especially, at the time of large events organized during summer, including the Olympic Games or various types of happenings in amusement parks like Disneyland or other popular venues. The risk of heatstroke is naturally affected by a high temperature, but it is also dependent on various other contextual factors such as the presence of shaded areas along traveling routes or the distribution of relief stations. The purpose of the study is to develop a method to reduce the heatstroke risk of pedestrians for large outdoor events by optimizing relief station placement, volume scheduling and route. Results Our experiments conducted on the planned site of the Tokyo Olympics and simulated during the two weeks of the Olympics schedule indicate that planning routes and setting relief stations with our proposed optimization model could effectively reduce heatstroke risk. Besides, the results show that supply volume scheduling optimization can further reduce the risk of heatstroke. The route with the shortest length may not be the route with the least risk, relief station and physical environment need to be considered and the proposed method can balance these factors. Conclusions This study proposed a novel emergency service problem that can be applied in large outdoor event scenarios with multiple walking flows. To solve the problem, an effective method is developed and evaluates the heatstroke risk in outdoor space by utilizing context-aware indicators which are determined by large and heterogeneous data including facilities, road networks and street view images. We propose a Mixed Integer Nonlinear Programming model for optimizing routes of pedestrians, determining the location of relief stations and the supply volume in each relief station. The proposed method can help organizers better prepare for the event and pedestrians participate in the event more safely.


2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Lianfei Yu ◽  
Cheng Zhu ◽  
Jianmai Shi ◽  
Weiming Zhang

Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP) for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.


2017 ◽  
Vol 5 (3) ◽  
pp. 267-278 ◽  
Author(s):  
Peng Jia ◽  
Weilun Zhang ◽  
E Wenhao ◽  
Xueshan Sun

Abstract Due to the long operation cycle of maritime transportation and frequent fluctuations of the bunker fuel price, the refueling expenditure of a chartered ship at different time or ports of call make significant difference. From the perspective of shipping company, an optimal set of refueling schemes for a ship fleet operating on different voyage charter routes is an important decision. To address this issue, this paper presents an approach to optimize the refueling scheme and the ship deployment simultaneously with considering the trend of fuel price fluctuations. Firstly, an ARMA model is applied to forecast a time serials of the fuel prices. Then a mixed-integer nonlinear programming model is proposed to maximize total operating profit of the shipping company. Finally, a case study on a charter company with three bulk carriers and three voyage charter routes is conducted. The results show that the optimal solution saves the cost of 437,900 USD compared with the traditional refueling scheme, and verify the rationality and validity of the model.


2020 ◽  
Vol 10 (4) ◽  
pp. 1489 ◽  
Author(s):  
Xianlong Ge ◽  
Xiaobo Ge ◽  
Weixin Wang

Due to the gradual improvement of urban traffic network construction and the increasing number of optional paths between any two points, how to optimize a vehicle travel path in a multi-path road network and then improve the efficiency of urban distribution has become a difficult problem for logistics companies. For this purpose, a mixed-integer mathematical programming model with a time window based on multiple paths for urban distribution in a multi-path environment is established and its exact solution solved using software CPLEX. Additionally, in order to test the application and feasibility of the model, simulation experiments were performed on the four parameters of time, distance, cost, and fuel consumption. Furthermore, using Jingdong (JD), the main urban area in Chongqing, as an example, the experimental results reveal that an algorithm that considers the path selection can significantly improve the efficiency of urban distribution in metropolitan areas with complex road structures.


2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Dandan Hu ◽  
Zhi-Wei Liu ◽  
Wenshan Hu

In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.


Sign in / Sign up

Export Citation Format

Share Document