A. P. M. Wagelmans

Publication List Details

Period

1989 - 2007

Number

97

Co-Authors

Four equivalent lot-sizing models (2007)

Heuvel, W. Van Den, Wagelmans, A.P.M.

We study the following lot-sizing models that recently appeared in the literature: a lot-sizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing...

"Rotterdam econometrics": publications of the econometric institute 1956-2005 (2006)

Dijk, H.K. Van, Kaashoek, J.F., Wagelmans, A.P.M.

This paper contains a list of all publications over the period 1956-2005, as reported in the Rotterdam Econometric Institute Reprint series during 1957-2005.

"Rotterdam Econometrics": an analysis of publications of the econometric institute 1956-2004 (2006)

Dijk, H.K. Van, Kaashoek, J.F., Wagelmans, A.P.M.

The high ranking of the Econometric Institute, as listed in recent leading scientific journals, is examined for a fifty year period using similar standard measures. The distribution of the...

Optimal redesign of the Dutch road network (2005)

Snelder, M., Wagelmans, A.P.M., Schrijver, J.M., Zuylen, H.J. Van, Immers, L.H.

The Dutch national road network has been developed over several decades. In the past, roads were constructed according to the then current spatial and transportation planning philosophies. Because...

Optimal Redesign of the Dutch Road Network (2005)

Snelder, M., Wagelmans, A.P.M., Schrijver, J.M., Zuylen, H.J. Van, Immers, L.H., Wagelmans@few.eur.nl

The Dutch national road network has been developed over several decades. In the past, roads were constructed according to the then current spatial and transportation planning philosophies. Because...

A solution approach for dynamic vehicle and crew scheduling (2004)

Huisman, D., Wagelmans, A.P.M.

In this paper, we discuss the dynamic vehicle and crew scheduling problem and we propose a solution approach consisting of solving a sequence of optimization problems. Furthermore, we explain why it...

A note on a multi-period profit maximizing model for retail supply chain management (2003)

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this note we present an efficient exact algorithm to solve the joint pricing and inventory problem for which Bhattacharjee and Ramesh (2000) proposed two heuristics. Our algorithm appears to be...

A Polynomial Time Algorithm for a Deterministic Joint Pricing and Inventory Model (2003)

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this paper we consider the uncapacitated economic lot-size model, where demand is a deterministic function of price. In the model a single price need to be set for all periods. The objective is to...

A Geometric Algorithm to solve the NI/G/NI/ND Capacitated Lot-Sizing Problem in O(T^2) Time (2003)

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this paper we consider the capacitated lot-sizing problem (CLSP) with linear costs. It is known that this problem is NP-hard, but there exist special cases that can be solved in polynomial time....

Multi-Depot Integrated Vehicle and Crew Scheduling (2003)

Huisman, D., Freling, R., Wagelmans, A.P.M.

This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and...

Combining Column Generation and Lagrangian Relaxation (2003)

Huisman, D., Jans, R., Peeters, M., Wagelmans, A.P.M.

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways...

Moeilijk doen als het ook makkelijk kan (2002)

Wagelmans, A.P.M.

Rede, in verkorte vorm uitgesproken op vrijdag 20 september 2002 bij de aanvaarding van het ambt van bijzonder hoogleraar aan de Faculteit der Economische Wetenschappen, vanwege de Vereniging...

A Note on Ending Inventory Valuation in Multiperiod Production Scheduling (2002)

Heuvel, W. Van Den, Wagelmans, A.P.M.

In a recent paper, Fisher et al. (2001) present a method to mitigate end-effects in lot sizing byincluding a valuation term for end-of-horizon inventory in the objective function of the short-horizon...

Polynomial Time Algorithms For Some Multi-Level Lot-Sizing Problems With Production Capacities (2002)

Hoesel, S. Van, Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation...

Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities (2002)

Hoesel, S. Van, Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation...

Dynamic Scheduling of Handling Equipment at Automated Container Terminals (2001)

Meersmans, P.J.M., Wagelmans, A.P.M.

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal in a dynamic environment. This means that the handling times...

A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm (2001)

Freling, R., Lentink, R.M., Wagelmans, A.P.M.

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We...

Rostering at a Dutch Security Firm (2001)

Freling, R., Piersma, N., Wagelmans, A.P.M., Wetering, A. Van De

The roster planning process at the Dutch security firm NVD was traditionally carried out by hand. A few years NVD was traditionally carried out by hand. A few years ago, because of changing labor...

A dynamic approach to vehicle scheduling (2001)

Huisman, D., Freling, R., Wagelmans, A.P.M.

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is...

Effective algorithms for integrated scheduling of handling equipment at automated container terminals (2001)

Meersmans, P.J.M., Wagelmans, A.P.M.

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the...

Applying an Integrated Approach to Vehicle and Crew Scheduling in Practice (2000)

Freling, R., Huisman, D., Wagelmans, A.P.M.

This paper deals with a practical application of an integrated approach to vehicle and crew scheduling, that we have developed previously. Computational results have shown that our approach can be...

Models and algorithms for Integration of Vehicle and Crew Scheduling (2000)

Freling, R., Huisman, D., Wagelmans, A.P.M.

This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the...

Parametric Analysis of Setup Cost in the Economic Lot-Sizing Model without Speculative Motives (2000)

Hoesel, C.P.M. Van, Wagelmans, A.P.M.

In this paper we consider the important special case of the economic lot-sizing problem in which there are no speculative motives to hold inventory. We analyze the effects of varying all setup costs...

An Integer Programming Problem and Rank Decomposition of Block Upper Triangular Matrices (2000)

Bart, H., Wagelmans, A.P.M.

A necessary and sufficient condition is given for a block upper triangular matrix A to be the sum of block upper rectangular matrices satisfying certain rank constraints. The condition is formulated...

A Dynamic Lot-Sizing Model with Demand Time Windows (1999)

Lee, C.Y., Çetinkaya, S., Wagelmans, A.P.M.

One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not...

A dynamic lot-sizing model with demand time windows (1999)

Lee, C.-Y., Cetinkaya, S., Wagelmans, A.P.M.

One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not...

A branch and price algorithm for the multi-period single-sourcing problem (1999)

Freling, R., Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.

In this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the...

A Branch and Price Algorithm for the Multi-Period Single-Sourcing Problem (1999)

Freling, R., Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.

In this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the...

A savings based method for real-life vehicle routing problems (1999)

Poot, A., Kant, G., Wagelmans, A.P.M.

This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional...

Finding a Feasible Solution for a Simple LP Problem using Agents (1999)

Bruin, A. De, Kindervater, G.A.P., Vredeveld, T., Wagelmans, A.P.M.

In this paper we will describe a Multi-Agent System which is capable of finding a feasible solution of a specially structured linear programming problem. Emphasis is given to correctness issues and...

On the Complexity of Postoptimality Analysis of 0/1 Programs (1999)

Hoesel, S. Van, Wagelmans, A.P.M.

In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear objective function. After an optimal solution has been determined for a given cost vector, one may...

Improved dynamic programs for batching problems with maximum lateness criterion (1998)

Wagelmans, A.P.M., Gerodimos, A.E.

We study a class of scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature which consist of...

Media planning by optimizing contact frequencies (1998)

Piersma, N., Kapsenberg, S., Kloprogge, P., Wagelmans, A.P.M.

In this paper we study a model to estimate the probability that a target group of an advertising campaign is reached by a commercial message a given number of times. This contact frequency...

Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems (1997)

Hoesel, C.P.M. Van, Wagelmans, A.P.M.

NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results...

Calculation of Stability Radii for Combinatorial Optimization Problems (1996)

Chakravarti, N., Wagelmans, A.P.M.

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in...

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems (1996)

Hoesel, C.P.M. Van, Wagelmans, A.P.M.

NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results...

On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule (1996)

Sotskov, Y.N., Wagelmans, A.P.M., Werner, F.

The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the...

An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities (1996)

Hoesel, C.P.M. Van, Wagelmans, A.P.M.

Presents an algorithm that solves the constant capacities economic lot-sizing problem, with concave production costs and linear holdings cost in O(T3) time. Notations used; Results of a greedy...

An O ( n log n ) algorithm for the two-machine ow shop problem with controllable machine speeds (1995)

Hoesel, C.P.M. Van, Vliet, M. Van, Wagelmans, A.P.M.

In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O ( n log n ) time,...

An O ( T 3) algorithm for the economic lot-sizing problem with constant capacities (1995)

Hoesel, C.P.M. Van, Wagelmans, A.P.M.

We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding costs in O(T3) time. The algorithm is based on the standard...

An Algorithm for Single-item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs (1995)

Shaw, D.X., Wagelmans, A.P.M.

We consider the Capacitated Economic Lot Size problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A...

Models and Algorithms for Vehicle Scheduling (1995)

Freling, R., Pinto Paixão, J.M., Wagelmans, A.P.M.

Vehicle scheduling is the process of assigning vehicles to a set of predetermined trips with fixed starting and ending times, while minimizing capital and operating costs. This paper considers the...

Economic Lot-Sizing: an O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (1992)

Wagelmans, A.P.M., Hoesel, S. Van, Kolen, A.W.J.

We consider the n-period economic lot sizing problem, where the cost coefficients are not restricted in sign. In their seminal paper, H. M. Wagner and T. M. Whitin proposed an O(n[sup 2]) algorithm...

Rostering at a Dutch Security Firm

Freling, R., Piersma, N., Wagelmans, A.P.M., Wetering, A. Van De

The roster planning process at the Dutch security firm NVD was traditionally carried out by hand. A few years NVD was traditionally carried out by hand. A few years ago, because of changing labor...

Dynamic Scheduling of Handling Equipment at Automated Container Terminals

Meersmans, P.J.M., Wagelmans, A.P.M.

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal in a dynamic environment. This means that the handling times...

A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm

Freling, R., Lentink, R.M., Wagelmans, A.P.M.

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We...

Effective algorithms for integrated scheduling of handling equipment at automated container terminals

Meersmans, P.J.M., Wagelmans, A.P.M.

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the...

A dynamic approach to vehicle scheduling

Huisman, D., Freling, R., Wagelmans, A.P.M.

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is...

Polynomial Time Algorithms For Some Multi-Level Lot-Sizing Problems With Production Capacities

Hoesel, S. Van, Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation...

A Note on Ending Inventory Valuation in Multiperiod Production Scheduling

Heuvel, W. Van Den, Wagelmans, A.P.M.

In a recent paper, Fisher et al. (2001) present a method to mitigate end-effects in lot sizing byincluding a valuation term for end-of-horizon inventory in the objective function of the short-horizon...

Optimal Redesign of the Dutch Road Network

Snelder, M., Wagelmans, A.P.M., Schrijver, J.M., Zuylen, H.J. Van, Immers, L.H.

The Dutch national road network has been developed over several decades. In the past, roads were constructed according to the then current spatial and transportation planning philosophies. Because...

Moeilijk doen als het ook makkelijk kan

Wagelmans, A.P.M.

Rede, in verkorte vorm uitgesproken op vrijdag 20 september 2002 bij de aanvaarding van het ambt van bijzonder hoogleraar aan de Faculteit der Economische Wetenschappen, vanwege de Vereniging...

Combining Column Generation and Lagrangian Relaxation

Huisman, D., Jans, R.F., Peeters, M., Wagelmans, A.P.M.

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways...

Models and algorithms for Integration of Vehicle and Crew Scheduling

Freling, R., Huisman, D., Wagelmans, A.P.M.

This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the...

Applying an Integrated Approach to Vehicle and Crew Scheduling in Practice

Freling, R., Huisman, D., Wagelmans, A.P.M.

This paper deals with a practical application of an integrated approach to vehicle and crew scheduling, that we have developed previously. Computational results have shown that our approach can be...

A Polynomial Time Algorithm for a Deterministic Joint Pricing and Inventory Model

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this paper we consider the uncapacitated economic lot-size model, where demand is a deterministic function of price. In the model a single price need to be set for all periods. The objective is to...

A Geometric Algorithm to solve the NI/G/NI/ND Capacitated Lot-Sizing Problem in O(T^2) Time

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this paper we consider the capacitated lot-sizing problem (CLSP) with linear costs. It is known that this problem is NP-hard, but there exist special cases that can be solved in polynomial time....

A note on a multi-period profit maximizing model for retail supply chain management

Heuvel, W. Van Den, Wagelmans, A.P.M.

In this note we present an efficient exact algorithm to solve the joint pricing and inventory problem for which Bhattacharjee and Ramesh (2000) proposed two heuristics. Our algorithm appears to be...

An O ( T ³) algorithm for the economic lot-sizing problem with constant capacities

Hoesel,C.P.M.,van, Wagelmans,A.P.M.

We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding costs in O(T³) time. The algorithm is based on the standard...

An O ( n log n ) algorithm for the two-machine ow shop problem with controllable machine speeds

Hoesel,C.P.M.,van, Wagelmans,A.P.M., Vliet,M.,van

In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for a