Computerized vehicle routing in the soft drink industry
Operations Research
Flight scheduling and maintenance base planning
Management Science
The vehicle routing problem
Quantitative Models for Supply Chain Management
Quantitative Models for Supply Chain Management
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
Transportation Science
Synchronized Development of Production, Inventory, and Distribution Schedules
Transportation Science
Coordination of Production/Distribution Networks with Unbalanced Leadtimes
Operations Research
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
Context-Independent Scatter and Tabu Search for Permutation Problems
INFORMS Journal on Computing
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
Operations Research Letters
The integrated production---inventory---distribution---routing problem
Journal of Scheduling
Heuristics for a multiperiod inventory routing problem with production decisions
Computers and Industrial Engineering
A branch-and-price algorithm for an integrated production and inventory routing problem
Computers and Operations Research
A decision support approach for assigning reviewers to proposals
Expert Systems with Applications: An International Journal
Tabu search with path relinking for an integrated production-distribution problem
Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
A reactive GRASP with path relinking for capacitated clustering
Journal of Heuristics
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers and Operations Research
A sequential GRASP for the therapist routing and scheduling problem
Journal of Scheduling
International Journal of Knowledge-based and Intelligent Engineering Systems
Hi-index | 0.01 |
An NP-hard production-distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory levels and distribution into account. An integer linear model is proposed as a compact problem specification but it cannot be solved to optimality for large instances. Instead of using a classical two-phase approach (production planning and then route construction for each day), metaheuristics that simultaneously tackle production and routing decisions are developed: a GRASP (greedy randomized adaptive search procedure) and two improved versions using either a reactive mechanism or a path-relinking process. These algorithms are evaluated on 90 randomly generated instances with 50, 100 and 200 customers and 20 periods. The results confirm the interest of integrating production and distribution decisions, compared to classical two-phase methods. Moreover, reaction and path-relinking give better results than the GRASP alone.