Results 51 to 60 of about 1,705 (196)
An iterative matheuristic for the inventory routing problem
Computers & Operations Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simen T. Vadseth +2 more
openaire +2 more sources
Matheuristic approaches for multi-product 3-dimensional container loading problem
Applied Operations and AnalyticsThe problem of packing cases in three-dimensional space in a space-efficient manner is a challenging optimization problem that has wide application in supply-chain and logistics planning across various industries where physical products must be loaded ...
Riddhesh Nitin Kumtakar +4 more
doaj +1 more source
A Lagrangian-ACO matheuristic for car sequencing [PDF]
EURO Journal on Computational Optimization, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dhananjay R. Thiruvady +2 more
openaire +3 more sources
A Matheuristic for the Distance Constrained Inventory Routing Problem
MathematicsThis paper addresses the Distance-Constrained Inventory Routing Problem (DCIRP), a complex problem that combines inventory management and vehicle routing in a logistics context.
Víctor Manuel Valenzuela-Alcaraz +4 more
doaj +1 more source
Matheuristics to solve the Traveling Analyst Problem
, 2023 Exploratory Data Analysis (EDA), the notoriously tedious task of interactively analyzing datasets to gain insights, has attracted a lot of attention lately in the data management community.
Labroche, Nicolas +3 more
core
Operations Research Perspectives, 2020 This article introduces a new variant of the inventory routing problem related to real-world businesses. Specifically, in the beverage industry, business customers such as restaurants and bars, demand consistent delivery times, have different opening ...
Emilio J. Alarcon Ortega +2 more
doaj +1 more source
A matheuristic for exam timetabling
IFAC-PapersOnLine, 2016 Exam timetabling is a tedious task faced in universities. We present a matheuristic to solve the exam timetabling problem related to the Toronto benchmark. We propose first a non-linear formulation used to find an initial feasible solution. We briefly describe a former linear formulation and introduce a new compact linear formulation.
Arbaoui, Taha +2 more
openaire +3 more sources
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
A Chance‐Constrained Model for a Production Routing Problem With Uncertain Availability of Vehicles
Networks, EarlyView.ABSTRACT The Production Routing Problem (PRP) is a complex integrated problem that allows for the achievement of competitive advantages, such as better management of inventory, reduction in operational costs and lead times, improvement in efficiency and customer service, and better response to market changes.
Alline Zanette +2 more
wiley +1 more source
International Transactions in Operational Research, EarlyView.Abstract We study the problem of locating hydrogen fueling stations for zero‐emission aquaculture vessels in Norway and model the problem as a location‐routing problem, considering both the location of hydrogen fueling stations and the routing of aquaculture vessels.
Šárka Štádlerová +3 more
wiley +1 more source