Waste clean-up after a disaster is one of the most critical tasks in response stage management. We develop model to minimise cost and duration waste considering using Temporary Disaster Management Sites (TDWMSs), which can store process before it sent final disposal sites. The problem that arises be seen as Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) main decisions are location...

One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

Disaster relief distribution is a very important component in the overall disaster response process. Consideration of limited funds, time pressure and surge demand that come together increase to complexity process must be done short time. Meanwhile, delays delivery can lead decrease level safety welfare disaster-affected victims. This paper proposes location routing problem optimization model f...

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

This article deals with a complex vehicle routing problem that can be seen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problem that considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is cost minimization, the second is balancing work leve...

In networks where nodes are aware of their locations via the use of a GPS receiver or other localization techniques, geographic routing has been suggested to be the candidate of choice for robust and resource efficient routing. However, efficient location management algorithms are required for the source node to obtain the destination node’s location before it can start data transfer using geog...

The train plan of urban rail transit under multi-routing mode can be divided into three parts: train formation, train operation periods and corresponding train counts of each routing in each period. Based on the analysis of passenger’s general travel expenses and operator’s benefits, the constraints and objective functions are defined and the multiobjective optimization model for the train plan...