We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine at a plant, where job Ji is associated with its processing time and a customer i located at location i to which the job is to be delivered. In addition, there is a single uncapacitated delivery vehicle available. All jo...

this paper presents a new mathematical model for a combined manpower vehicle routing problem, in which working teams are considered as servers. having teams with different competency affects the service duration and cost that expands the flexibility of scheduling. a fleet of vehicles with different speed and cost of movement is used to transport these teams to visit the customers before the due...

This paper presents a two-stage approach for solving the medication distribution problem. The problem addresses a critical issue in emergency preparedness. Public health officials must plan the logistics for distributing medication to points of dispensing (PODs), which will give medication to the public in case of a bioterrorist attack such as anthrax. We consider the problem at the state and l...

Since early 2010s, the Green Routing Problem (GRP) has dominated literature of logistics and transportation. The problem itself consists finding a set vehicle routes for customers while minimizing detrimental effects transportation activities. These negative externalities have been intensively tackled in last decade. Operations research studies particularly focused on energy consumption emissio...

In this paper we consider a real-time, dynamic pickup and delivery problem with timewindows where orders should be assigned to one of a set of competing transportation companies. Our approach decomposes the problem into a multi-agent structure where vehicle agents are responsible for the routing and scheduling decisions and the assignment of orders to vehicles is done by using a second-price au...

One of the most important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. In various methods, cross-docking is considered a good method to reduce inventory and improve responsiveness to various customer...

Most successful solution methods for solving large vehicle routing and scheduling problems are based on local search. A drawback of these approaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to handle new restrictions without losing solution quality. This is a particular drawback, s...

In this paper, we consider two-tier City Logistics systems accounting for both the inbound and outbound traffic that have not been taken into account in models and algorithms for vehicle routing research. The problem under study, called the Multi-zone Multi-trip Pickup and Delivery Problem with Time Windows and Synchronization, has two sets of intertwined decisions: the routing decisions which ...

The vehicle routing problem with time windows and multiple deliverymen (VRPTWMD) is a variant of the vehicle routing problem with time windows in which service times at customers depend on the number of deliverymen assigned to the route that serves them. Hence, in addition to the usual routing and scheduling decisions, the crew size for each route is also an endogenous decision. This problem is...