This article explores a structural neighborhood decomposition for arc routing problems, in which the decisions about traversal orientations during services are made optimally as part of neighbor evaluation procedures. Using memory structures, bidirectional dynamic programming, and lower bounds, we show that a large neighborhood involving classical moves on the sequences of services along with o...

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...

We introduce a traffic routing problem over an extended planning horizon that appears in geosynchronous satellite networks. Unlike terrestrial (e.g., fiber optic) networks, routing on a satellite network is not transparent to the customers. As a result, a route change is associated with significant monetary penalties that are usually in the form of discounts (up to 40%) offered by the satellite...

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...

Managers often face difficulties when making project decisions that involve large number of interrelated activities – the planning and scheduling of which is project management. Most problems often arise in areas such as product development, production planning and control and setting up the production facilities. One important aspect of project management is activity crashing, i.e. reducing th...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

This paper considers a routing and scheduling problem of forwarding agencies handling less-than-truckload (LTL) freight. On the one hand, the performance of these companies is influenced by unknown customer orders, increasingly received shortly before the actual pickup. On the other hand, the transport times between two consecutive points in a tour sometimes vary significantly. The objective is...

Jeremy P. Erickson: Managing Tardiness Bounds and Overload in Soft Real-Time Systems (Under the direction of James H. Anderson) In some systems, such as future generations of unmanned aerial vehicles (UAVs), different software running on the same machine will require different timing guarantees. For example, flight control software has hard real-time (HRT) requirements—if a job (i.e., invocatio...