[PDF] Top 20 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

... a maritime inventory routing problem where the travel times are un- ...avoid inventory shortfalls at the consumers and exceed inventory capacities at producers, a robust model ... See full document

... a MIP model and use this model in various solution approaches. Arc based models with arc variables representing the sail- ing between two ports, are used in branch-and-bound and branch-and-cut approaches ... See full document

... a stochastic population-based metaheuris- tic Talbi ( 2009 ) in which problem solving system mimic collective intelligence in nature ( Alam et ...the problem and is defined by its position ... See full document

... functions. Based on the dual La- grangian problem resulting from a Lagrangian relaxation of the reformulation of the adversarial problem, we provide a compact formulation to approximate the true ... See full document

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

... Currently many industrial plants handle manufacturing of small quantities of a large diversity of products. This makes that each job often has its own sequence of operations (e.g. wafer fabrication in the semiconductor ... See full document

... Historically, Costas arrays have been developed in the 1960’s to compute a set of sonar and radar frequencies avoiding noise. A Costas array is an n × n grid containing n marks such that there is exactly one mark per row ... See full document

... For a given set system on a universe of items and a collec- tion of a set of items, Minimum Set Cover Problem (MSCP) [1] finds the minimum number of sets that covers the whole universe. This is a NP hard ... See full document

... In the past, drones were an expensive UAV mostly used by the military. Only recently they have expanded to commercial, scientific, recreational and agricultural applications. In agriculture, the industrial expansion has ... See full document

... face stochastic demand and the system is controlled by continuous review installation stock policies with given batch quantities. A back order cost is provided to the warehouse and the warehouse chooses the ... See full document

... Several attempts have been made to solve the SAP [4] , Newton [5] introduces an exact algorithm that minimize the number of product terms, Micheli et al. [6] propose an algorithm knows as KISS (keep internal state ... See full document

... A search procedure generates networks to be evaluated by the scoring met- ...the problem of finding the best network has been shown to be NP-complete for most scoring metrics ...between search ... See full document

... Adaptive Search was proposed by [9,10] as a generic, domain-independent con- straint based local search ...the problem in terms of constraints and variables and can guide the ... See full document

... approach based on cluster partitioning to calculate improved upper bounds to the optimal solution of maximal covering location ...is based on the covering graph of potential facility locations that attend a ... See full document

... different heuristic placement routines namely BLF, LGF, FC, TP and LGFi using the lower bound proposed by Dell’Amico et ...two heuristic placement routines namely BLF and LGF where both routines required ... See full document

... is based on solving a sequence of convex quadratic programming problems to approximate the number ϑ − defined in (2) and embedding the best obtained solution on a tabu search heuristic to reach a ... See full document

... used as a heuristic to represent the degree of satisfaction of a constraint and thus gives an indication on how much the constraint is violated. This idea has also been proposed independently by Galin- ier and Hao ... See full document

... have routing capabilities and forward data packets to other nodes in multi-hop ...special routing algorithms to meet these ...other problem domains, has been applied to the MANET routing ... See full document

... our problem. For instance, Bruno et al. have developed a agent-based framework that could suit this ...large problem instances [8]. Maximo et al. developed a meta-heuristic, named by the ... See full document