Albert Wagelmans

Albert Peter Marie (Albert) Wagelmans (born 1960) is a Dutch economist and Professor of Management Science at the Erasmus School of Economics (ESE) of the Erasmus University Rotterdam working in the fields of mathematical optimization methods[1][2] for production, public transport and health care planning.

Biography

Born in 1960 in Rotterdam, Wagelmans received his MA in Econometrics at the Erasmus University Rotterdam in 1985, where in 1990 he received his Phd with the thesis entitled "Sensitivity analysis in combinatorial optimization," under supervision of Alexander Rinnooy Kan and Antoon Kolen.[3]

Wagelmans had started his academic career at the Erasmus University Rotterdam as teaching assistant in 1982, became Assistant Professor in 1986 and was Instructor at the MBA Executive Development program in 1987/88. In 1989 he was visiting researcher at the Katholieke Universiteit Leuven, and in 1990/91 visiting researcher at Massachusetts Institute of Technology. Back in Rotterdam in 2002 Wagelmans was appointed Professor of Operations Research at the Erasmus University Rotterdam, where he held his inauguration speech "Moeilijk doen als het ook makkelijk kan" (Making it hard, when it can be done easily) about the usefulness of mathematical analysis in decision problems.[4]

From 1999 to 2003 Wagelmans was director of the Rotterdam Institute for Business Economic Studies (RIBES), and Associate director of the Erasmus Research Institute of Management (ERIM). From 2006 to 2014 he was Director of the Econometric Institute as successor of Philip Hans Franses, and is succeeded by Patrick Groenen. He is research fellow of the Tinbergen Institute since 1999, and fellow of ERIM since 2006.[5]

Work

A Dynamic Lot-Sizing Model with Demand Time Windows, 2001

In the 2001 article "A Dynamic Lot-Sizing Model with Demand Time Windows" published in Management Science, Lee, Sila & Wagelmans described the dynamic lot-sizing model and "the dynamic lot-sizing problem with demand time windows and provides polynomial time algorithms for computing its solution."[6] They summarized this matter as follows:

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 allowed then the demand of a given period cannot be delivered earlier or later than the period. If backlogging is allowed, the demand of a given period cannot be delivered earlier than the period, but can be delivered later at the expense of a backordering cost. Like most mathematical models, the classical dynamic lot-sizing model is a simplified paraphrase of what might actually happen in real life. In most real life applications, the customer offers a grace period - we call it a demand time window - during which a particular demand can be satisfied with no penalty. That is, in association with each demand, the customer specifies an earliest and a latest delivery time. The time interval characterized by the earliest and latest delivery dates of a demand represents the corresponding time window.[6]

Jaruphongsa summarized that "Lee et al. (2001) generalize the classical (single echelon) dynamic lot-sizing model to consider demand time windows, and they provide polynomial time algorithms for two cases—where backorders are allowed and where they are not."[7]

Multiple-Depot Integrated Vehicle and Crew Scheduling, 2004

In the 2005 article "Multiple-Depot Integrated Vehicle and Crew Scheduling," Huisman, Freling and Wagelmans presented two new models and algorithms in the field of the vehicle routing problem, specifically for "integrated vehicle and crew scheduling in the multiple-depot case."[8] they explained:

The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and with the traditional sequential one on random generated as well as real-world data instances for a suburban/extra-urban mass transit system. To simulate such a transit system, we propose a new way of generating randomly data instances such that their properties are the same as for our real-world instances.[8]

Selected publications

Wagelmans has authored and co-authored numerous publications. Book:[9]

Articles, a selection:[10]

References

  1. ↑ Brahimi, Nadjib, et al. "Single item lot sizing problems." European Journal of Operational Research 168.1 (2006): 1-16.
  2. ↑ Pochet, Yves, and Laurence A. Wolsey. Production planning by mixed integer programming. Springer, 2006.
  3. ↑ Albert Wagelmans at the Mathematics Genealogy Project
  4. ↑ Moeilijk doen als het ook makkelijk kan (2002)
  5. ↑ Curriculum vitae Albert Wagelmans, sept 2006 at people.few.eur.nl. Accessed Sept. 25, 2014.
  6. ↑ 6.0 6.1 Lee, Sila & Wagelmans (2001)
  7. ↑ Jaruphongsa, Wikrom, Sila Cetinkaya, and Chung-Yee Lee. "Warehouse space capacity and delivery time window considerations in dynamic lot-sizing for a simple supply chain." International Journal of Production Economics 92.2 (2004): 169-180.
  8. ↑ 8.0 8.1 Huisman, Freling and Wagelmans (2005, p. 1)
  9. ↑ Albert Wagelmans Google Scholar, profile.
  10. ↑ Albert P. M. Wagelmans at DBLP Computer Science Bibliography.

External links