Richard W. Eglese

Orcid: 0000-0003-2781-9828

Affiliations:
  • Lancaster University, UK


According to our database1, Richard W. Eglese authored at least 34 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Preface: advances in theoretical and practical combinatorial optimization.
Ann. Oper. Res., 2019

2018
A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups.
Comput. Oper. Res., 2018

2017
Preface: Special issue on the VeRoLog 2015 conference.
Networks, 2017

2016
Choice-Based Demand Management and Vehicle Routing in E-Fulfillment.
Transp. Sci., 2016

Fuel emissions optimization in vehicle routing problems with time-varying speeds.
Eur. J. Oper. Res., 2016

2015
Guest editorial: Recent trends in vehicle routing.
Networks, 2015

Minimum cost VRP with time-dependent speed data and congestion charge.
Comput. Oper. Res., 2015

2014
Finding least fuel emission paths in a network with time-varying speeds.
Networks, 2014

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge.
Eur. J. Oper. Res., 2014

2013
Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs.
J. Oper. Res. Soc., 2013

The time-dependent prize-collecting arc routing problem.
Comput. Oper. Res., 2013

Disrupted capacitated vehicle routing problem with order release delay.
Ann. Oper. Res., 2013

2011
Disruption management of the vehicle routing problem with vehicle breakdown.
J. Oper. Res. Soc., 2011

2010
Vehicle routing and scheduling with time-varying data: A case study.
J. Oper. Res. Soc., 2010

Combinatorial optimization and Green Logistics.
Ann. Oper. Res., 2010

2009
General Routing Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
A unified tabu search algorithm for vehicle routing problems with soft time windows.
J. Oper. Res. Soc., 2008

Preface.
Discret. Appl. Math., 2008

A deterministic tabu search algorithm for the capacitated arc routing problem.
Comput. Oper. Res., 2008

2007
A branch-and-cut algorithm for the capacitated open vehicle routing problem.
J. Oper. Res. Soc., 2007

A Branch-and-Bound Algorithm for Finding All Optimal Solutions of the Assignment Problem.
Asia Pac. J. Oper. Res., 2007

2006
A Road Timetable<sup>TM</sup> to aid vehicle routing and scheduling.
Comput. Oper. Res., 2006

A constraint programming approach to the Chinese postman problem with time windows.
Comput. Oper. Res., 2006

2005
A new tabu search heuristic for the open vehicle routing problem.
J. Oper. Res. Soc., 2005

The grocery superstore vehicle scheduling problem.
J. Oper. Res. Soc., 2005

2004
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Math. Program., 2004

2003
Preface: International Symposium on Combinatorial Optimisation.
Discret. Appl. Math., 2003

2002
Multistars, partial multistars and the capacitated vehicle routing problem.
Math. Program., 2002

2000
Integrating simulation modelling and GIS: spatial decision support systems for evacuation planning.
J. Oper. Res. Soc., 2000

1998
Business Optimisation: Using mathematical programming.
J. Oper. Res. Soc., 1998

The rural postman problem with deadline classes.
Eur. J. Oper. Res., 1998

1996
CEMPS: A prototype spatial decision support system to aid in planning emergency evacuations.
Trans. GIS, 1996

1994
Routeing Winter Gritting Vehicles.
Discret. Appl. Math., 1994

1993
CEMPS: a configurable evacuation management and planning system-a progress report.
Proceedings of the 25th Winter Simulation Conference, 1993


  Loading...