Keyword: heuristics

Found 5460 papers in total
The Post-Disaster Debris Clearance Problem Under Incomplete Information
The Post-Disaster Debris Clearance Problem Under Incomplete Information
2015,
Debris management is one of the most time consuming and complicated activities among...
Optimizing Reorder Intervals for Two-Echelon Distribution Systems with Stochastic Demand
Optimizing Reorder Intervals for Two-Echelon Distribution Systems with Stochastic Demand
2015,
We consider a periodic‐review inventory system in which N non‐identical...
Technical Note–Trading Off Quick versus Slow Actions in Optimal Search
Technical Note–Trading Off Quick versus Slow Actions in Optimal Search
2015,
We consider the search for a target whose precise location is uncertain. The search...
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
2015,
We consider facility location problems where the demand is continuously and uniformly...
Analysis of MILP Techniques for the Pooling Problem
Analysis of MILP Techniques for the Pooling Problem
2015,
The pq ‐relaxation for the pooling problem can be constructed by applying...
Robust Queueing Theory
Robust Queueing Theory
2015,
We propose an alternative approach for studying queues based on robust optimization....
Oracle-Based Robust Optimization via Online Learning
Oracle-Based Robust Optimization via Online Learning
2015,
Robust optimization is a common optimization framework under uncertainty when problem...
Managing Underperformance Risk in Project Portfolio Selection
Managing Underperformance Risk in Project Portfolio Selection
2015,
We consider a project selection problem where each project has an uncertain return...
Production and Inventory Control for a Make-to-Stock/Calibrate-to-Order System with Dedicated and Shared Resources
Production and Inventory Control for a Make-to-Stock/Calibrate-to-Order System with Dedicated and Shared Resources
2015,
Consider a firm that produces multiple products on dedicated production lines (stage...
Iterative Auction Design for Tree Valuations
Iterative Auction Design for Tree Valuations
2015,
We study a special class of multi‐item valuations (tree valuations) that...
Benders Decomposition for Production Routing Under Demand Uncertainty
Benders Decomposition for Production Routing Under Demand Uncertainty
2015,
The production routing problem (PRP) is a generalization of the inventory routing...
An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem
An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem
2016,
We present an adaptive memory programming (AMP) metaheuristic to address the robust...
Inventory-Allocation Distribution Models for Postdisaster Humanitarian Logistics with Explicit Consideration of Deprivation Costs
Inventory-Allocation Distribution Models for Postdisaster Humanitarian Logistics with Explicit Consideration of Deprivation Costs
2016,
This paper develops novel mathematical models to maximize the benefits derived from...
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
2016,
We consider the two‐level uncapacitated facility location problem with...
Disruption management for vehicle routing problem with time-window changes
Disruption management for vehicle routing problem with time-window changes
2017,
In this paper, based on disruption management method, logistics distribution vehicle...
A bi-objective location inventory model for three-layer supply chain network design considering capacity planning
A bi-objective location inventory model for three-layer supply chain network design considering capacity planning
2017,
This paper aims at bi‐objective optimisation of single product for...
Material flow optimisation in a multi-echelon and multi-product supply chain
Material flow optimisation in a multi-echelon and multi-product supply chain
2017,
This paper addresses a distribution problem in a multi‐product,...
The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
2017,
In this paper, we investigate the problem of n‐jobs scheduling in an...
Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
2017,
In this paper, we propose two new heuristic tie‐breaking rules in the...
Product design development by integrating QFD approach with heuristics - AHP, ANN and fuzzy logics - a case study in miniature circuit breaker
Product design development by integrating QFD approach with heuristics - AHP, ANN and fuzzy logics - a case study in miniature circuit breaker
2017,
Quality function deployment is a customer oriented approach which captures customer...
A node-based ILP formulation for the node-weighted dominating Steiner problem
A node-based ILP formulation for the node-weighted dominating Steiner problem
2017,
In this article, we consider the Node‐Weighted Dominating Steiner Problem....
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
2017,
During the planning of communication networks, the routing decision process...
Cheapest paths in dynamic networks
Cheapest paths in dynamic networks
2017,
Flows over time problems relate to finding optimal flows over a capacitated network...
A penalized best-response algorithm for nonlinear single-path routing problems
A penalized best-response algorithm for nonlinear single-path routing problems
2017,
This article is devoted to nonlinear single‐path routing problems, which are...
Papers per page: