Information about the author Stefan Vo will soon be added to the site.
Information systems in seaports: a categorization and overview
Information systems have become indispensable to the competitiveness of ports,...
A heuristic approach for dividing graphs into bi-connected components with a size constraint
In this paper we propose a new problem of finding the maximal bi‐connected...
A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
The focus of this paper is on finding optimal solutions for the problem of maximal...
An equi-model matheuristic for the multi-depot ring star problem
In the multi‐depot ring star problem (MDRSP), a set of customers has to be...
Improved load balancing and resource utilization for the Skill Vehicle Routing Problem
The Skill Vehicle Routing Problem (Skill VRP) considers vehicle routing under the...
A hybridized tabu search approach for the minimum weight vertex cover problem
The minimum weight vertex cover problem is a basic combinatorial optimization problem...
A simple RFID cost model for the container shipping industry
Radio frequency identification (RFID) refers to the use of a transponder or...
A stochastic model for the implementation of postponement strategies in global distribution networks
When designing global production and distribution systems an important aspect becoming...
A mathematical formulation and complexity considerations for the blocks relocation problem
The blocks relocation problem (BRP) may be defined as follows: given a set of...
Applying the corridor method to a blocks relocation problem
In this paper, we present a corridor method inspired algorithm for a blocks relocation...
Experiments concerning sequential versus simultaneous maximization of objective function and distance
Suppose two solution vectors are needed that have good objective function values and...
The corridor method: a dynamic programming inspired metaheuristic
This paper presents a dynamic programming inspired metaheuristic called Corridor...
Production planning with load dependent lead times: an update of research
Lead times impact the performance of the supply chain significantly. Although there is...
Simple heuristics for scheduling with limited intermediate storage
Limited storage capacities impose important restrictions in production planning and...
Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application
We consider a real-world multi-mode multi-project scheduling problem in which the...
A heuristic approach for combined equipment-planning and routing in multi-layer Synchronous Digital Hierarchy and Wavelength Division Multiplex networks
The paper deals with a multi-layer network design problem for a high-speed...
Looking ahead with the pilot method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining...
Solving the continuous flow-shop scheduling problem by metaheuristics
Continuous flow-shop scheduling problems circumscribe an important class of sequencing...
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called...
Efficient path and vertex exchange in Steiner tree algorithms
Steiner's problem in a weighted graph requires a tree of minimum total weight spanning...
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is...
The Steiner tree problem with hop constraints
The Steiner tree problem in graphs is to determine a minimum cost subgraph of a given...
A case study in empty railcar distribution
Empty railcar distribution problems are considered to be at the very heart of freight...
Papers per page: