One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...

In this paper, we introduce the Vehicle Routing Problem with Flexible Time Windows (VRPFlexTW), in which vehicles are allowed to deviate from customer time windows by a given tolerance. This flexibility enables savings in the operational costs of carriers, since customers may be served before and after the earliest and latest time window bounds, respectively. However, as time window deviations ...

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

Troop movement involves transporting military personnel from one location to another using available means. To minimize damage enemies, the simultaneously uses reconnaissance and transportation units during troop movements. This paper proposes a vehicle routing problem considering (VRPCRT) for wartime The VRPCRT is formulated as mixed-integer programming model minimizing completion time of move...

Planning Waste Management involves the two major resources collection-vehicles and crews. The overall goal of our on-going project with two waste management companies is an integrative approach for planning the routes and the crews of the vehicles. Here we focus on the route generation as modeled in the first two phases of our three-phase optimization approach. We introduce relevant practical r...

Production scheduling is a part of operational research which relies on combinational optimization solved by discrete methods. This wide area covers different variety of problems like; vehicle routing problem, bin packing problem and job priority. In order to solve these problems, operational research applies two main principles: exact methods which provide the absolute best solution but solve ...