A scheme for determining vehicle routes based on Arc-based service network design

QR Code

A scheme for determining vehicle routes based on Arc-based service network design

In freight transportation, less-than-truckload carriers often need to assign each vehicle a cyclic route so that drivers can come back home after a certain period of time. However, the Node-Arc model for service network design addresses decisions on each arc and does not determine routes directly, a...

Full description

Bibliographic Details
Main Authors:	Jiang, Xiaoping, Bai, Ruibin, Atkin, Jason, Kendall, Graham
Format:	Article
Published:	Taylor & Francis 2017
Subjects:	Service network design depth first serach pruning set covering integer programming
Online Access:	https://eprints.nottingham.ac.uk/37728/

Similar Items

Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
by: Jiang, Xiaoping, et al.
Published: (2020)

A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
by: Bai, Ruibin, et al.
Published: (2015)

Effects of water and basin depths in single basin solar stills: an experimental and theoretical study
by: Feilizadeh, Mehrzad, et al.
Published: (2016)

A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
by: Bayliss, Christopher D., et al.
Published: (2016)

A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
by: Bayliss, Christopher D., et al.
Published: (2014)

Exploiting structure in integer programs
by: Mareček, Jakub
Published: (2012)

Using the symmetrical Tau criterion for feature selection decision tree and neural network learning
by: Hadzic, Fedja, et al.
Published: (2006)

Developing Thinning and Pruning Guidelines for Acacia Mangium Plantations in Peninsular Malaysia Using Tree Growth Characteristics
by: Paudyel, Bimal keshari
Published: (1990)

Effect of sucker pruning on sago palm (Mextroxylon sago Rottb.) growth performance
by: Howell, Peter Stanley
Published: (2017)

Mining value-based item packages - An integer programming approach
by: Achuthan, Narasimaha, et al.
Published: (2006)

Tabu assisted guided local search approaches for freight service network design
by: Bai, Ruibin, et al.
Published: (2012)

An exact penalty function method for nonlinear mixed discrete programming problems
by: Changjun, Y., et al.
Published: (2013)

Optimal timetable synchronization for greater Kuala Lumpur using mixed integer programming / Saiyidatul Adidah Idris
by: Idris, Saiyidatul Adidah
Published: (2020)

Problem restructuring in interger programming for reduct searching
by: Ungku Chulan, Ungku Azmi Iskandar
Published: (2003)

Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman
by: Abdul Rahman, Faridah
Published: (2012)

E-coupon laundry service system (ECLYSS) / Wan Najmi Syahirah Sukri
by: Sukri, Wan Najmi Syahirah
Published: (2014)

Optimizing tree planting areas through integer programming and improved genetic algorithm
by: Md Badarudin, Ismadi
Published: (2012)

The capacity-C torch problem
by: Backhouse, Roland, et al.
Published: (2015)

A novel approach to independent taxi scheduling problem based on stable matching
by: Bai, Ruibin, et al.
Published: (2014)

Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
by: Wong, Lily
Published: (2009)

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Office space allocation by using mathematical programming and meta-heuristics
by: Ulker, Ozgur
Published: (2013)

Growth and phytochemical responses of Andrographis paniculata as influenced by different shade levels and prunings
by: Omar, Nur Faezah, et al.
Published: (2016)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2017)

A Robust Cover Generation Technique for Steganography Using 2D Images
by: Ahmad Zawawi, Md. Nabil
Published: (2006)

Novel approaches to radiotherapy treatment scheduling
by: Leite Rocha, Pedro
Published: (2011)

House rental selection system using analytic hierarchy process (HRSS) / Siti Naemah Md Azlan
by: Md Azlan, Siti Naemah
Published: (2014)

Task rescheduling model for resource disruption problem in unrelated parallel processor system
by: Nordin, Syarifah, et al.
Published: (2014)

Towards a unified theory of GNSS ambiguity resolution
by: Teunissen, Peter
Published: (2003)

ADOP based upper bounds for the bootstrapped and the least squares ambiguity success.
by: Teunissen, Peter
Published: (2000)

Analogues of Picard sets for meromorphic functions with a deficient value
by: Kendall, Guy
Published: (2004)

Models, solution methods and threshold behaviour for the teaching space allocation problem
by: Beyrouthy, Camille
Published: (2008)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization
by: De, Arijit, et al.
Published: (2016)

Integrated Optimization of Underground Mine Design and Scheduling
by: Little, J, et al.
Published: (2013)

A λ-cut approximate algorithm for goal-based bilevel risk management systems
by: Gao, Y., et al.
Published: (2008)