The Vehicle Routing Problem with Release and Due Dates

Autor: Chris N. Potts, Maria Battarra, Benjamin C. Shelbourne

Publikováno v: Shelbourne, B, Battarra, M & Potts, C N 2017, ' The Vehicle Routing Problem with Release and Due Dates ', INFORMS Journal on Computing, vol. 29, no. 4, pp. 705-723 . https://doi.org/10.1287/ijoc.2017.0756

A novel extension of the classical vehicle routing and scheduling problems is introduced that integrates aspects of machine scheduling into vehicle routing. Associated with each customer order is a release date that defines the earliest time that the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::814e3b9b7096bceeb747a4dda551f8db
https://doi.org/10.1287/ijoc.2017.0756

A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem

Autor: Chris N. Potts, Teodor Gabriel Crainic, Tolga Bektaş, Dimitris C. Paraskevopoulos

Publikováno v: Paraskevopoulos, D C, Bektaş, T, Crainic, T G & Potts, C N 2016, ' A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem ', European Journal of Operational Research, vol. 253, no. 2, pp. 265-279 . https://doi.org/10.1016/j.ejor.2015.12.051

This paper presents an evolutionary algorithm for the fixed-charge multicommodity network design problem (MCNDP), which concerns routing multiple commodities from origins to destinations by designing a network through selecting arcs, with an objectiv

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5447d3f473a75e4a04c7d2b78e006b5f
https://doi.org/10.1016/j.ejor.2015.12.051

Online production planning to maximize the number of on-time orders

Autor: Nicholas G. Hall, Marc E. Posner, Chris N. Potts

We consider a production planning problem with two planning periods. Detailed planning occurs in the first period, when complete information is known about a set of orders that are initially available. An additional set of orders becomes available at

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e6f333dcee40932ac93b740efc6abf0
https://eprints.soton.ac.uk/422682/

Addressing nodal constraints on the capacity of railways

Autor: Jonathan Preston, Tolga Bektaş, Chris N. Potts, John Armstrong, Dimitris C. Paraskevopoulos

As the demand for passenger and freight transport on Britain’s railways increases, providing additional capacity and making the best use of the existing infrastructure are priorities for the industry. Since the stations and junctions forming the no

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f81cfb899cf412c5b454b3ea302741ce
https://openaccess.city.ac.uk/id/eprint/19848/1/Addressing_nodal_constraints_on_railway_capacity.pdf

An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

Autor: Chris N. Potts, Maria Battarra, Anand Subramanian

Publikováno v: International Journal of Production Research. 52:2729-2742

The single machine total weighted tardiness problem with sequence-dependent setup times (often known as problem ) requires a given set of jobs to be sequenced on a single machine, where a setup time is required before the processing of each job that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b0cb3c4328481362d5b1e8339a56669e
https://doi.org/10.1080/00207543.2014.883472