[PDF] Top 20 A hybrid heuristic for a stochastic production-inventory-routing problem
Has 7286 "A hybrid heuristic for a stochastic production-inventory-routing problem" found on our website. Below are the top 20 most common "A hybrid heuristic for a stochastic production-inventory-routing problem".
A hybrid heuristic for a stochastic production-inventory-routing problem
... item stochastic production-inventory-routing problem (SPIRP) with a single supplier/producer and multiple ...managed inventory approach is followed where the supplier monitors ... See full document
10
Robust optimization for a maritime inventory routing problem
... ship routing and scheduling problem with uncertain travel times using robust ...various heuristic strategies to achieve robust weekly voyages and schedules for o-shore supply vessels working un- der ... See full document
36
A MIP based local search heuristic for a stochastic maritime inventory routing problem
... the MIP based lo al sear h heuristi using the starting solution with no inventory deviations. The best result from the two approa hes is highlighted in bold[r] ... See full document
16
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
... an inventory routing problem with uncer- tain ...the inventory routing optimization problem where customer demand rates and travel times are stochastic but ...stationary. ... See full document
28
Inventory routing under uncertainty
... soft inventory levels to handle uncertainties in sailing and port time, and these levels were transformed into soft time windows in a single product deterministic MIRP ...The problem considered in Rakke et ... See full document
237
Heuristic Placement Routines for Two-Dimensional Bin Packing Problem
... Heuristic placement routine for non-oriented case: The heuristic placement routine, LGFi is a modified version of LGF. Unlike LGF, LGFi chooses the shortest edge between the remaining gap height and gap ... See full document
8
Optimization models and solution methods for inventory routing problems
... hand, inventory management decisions have to adequately synchronize with the distribution plan in order to ensure feasibility and efficiency in the latter ...vendor-managed inventory business model, in ... See full document
146
Ant Colony Optimization for Capacitated Vehicle Routing Problem
... To apply the ACO for solving the CVRP, Voss (1999) first developed an ACO algorithm which is called Ant System (AS) for the problem and then presented an improved AS in Bullnheimer et al. (1999). Since then, many ... See full document
7
Problema de Roteamento de Veículos – Vehicle Routing Problem (VRP)
... geograficamente dispersas, encontrar o melhor conjunto de rotas para atender todos os. clientes[r] ... See full document
45
Assignment Problem and Vehicle Routing Problem for an Improvement of Cash Distribution
... this problem would be multiple depot vehicle routing problems with time ...assignment problem is employed and capacitated vehicle routing problem with time window (VRPTW) is used ... See full document
5
A bounded heuristic for collection-based routing in wireless sensor networks
... a heuristic algorithm for the planning of both routing and collections, in wireless sensor ...the heuristic is able to find feasible and cost effective solutions, approaching its lower ... See full document
7
13 Logistics: The Vehicle Routing Problem
... Vehicle Routing Problem 177 The contribution of this work is then to define a powerful yet simple cMA capable of competing with the best known approaches for solving CVRP in terms of accuracy (final cost) ... See full document
12
A decomposition heuristic for the maximal covering location problem
... the problem size increases, the computational time may grow excessively, making the problem intractable even for the most efficient ...large-scale problem is divided into a number of smaller-scale ... See full document
13
Modeling a four-layer location-routing problem
... and routing problems; they specify that a customer can be allocated to a facility only if there is a tour from that facility going through that ...the production capacity of the ... See full document
10
A PageRank-based heuristic for the minimization of open stacks problem.
... The MOSP is NP-hard [ 2 ], and because P6¼NP, unless proven otherwise, the processing time and memory consumption will increase or the solution quality will decrease with increas- ing dimension of the problem. ... See full document
24
Development and Testing of the Meta-Heuristic Hybrid DEEPSO
... Ultimately GA and EP/ES are two branches of the EA family and therefore they have common characteristics, which are based on a selection process for a population with evolutionary character. Initially, in its canonical ... See full document
105
A Fast Heuristic for a Lot Splitting and Scheduling Problem of a Textile Industry
... Our problem is to some extent related with the classical parallel machine scheduling problem (PMSP), in which there are n jobs to schedule in m machines aiming at optimizing a certain performance measure, ... See full document
6
A heuristic approach for a multi-period capacitated single-allocation hub location problem
... Location Problem with a Budget Constraint on the fixed costs of opening, closing and maintaining hubs and hub ...the problem, not even small- sized instances can be solved to optimality using general MIP ... See full document
66
The crew scheduling and routing problem in road restoration
... and Routing Problem (CSRP), which integrates scheduling and routing ...The problem also involves the design of relief paths to con- nect a supply depot to demand nodes that become accessible ... See full document
169
temas relacionados