Zhixing Luo

Orcid: 0000-0002-0491-1501

According to our database1, Zhixing Luo authored at least 23 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Integrated optimisation of loading schedules and delivery routes.
Int. J. Prod. Res., August, 2023

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand.
Manuf. Serv. Oper. Manag., March, 2023

A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries.
INFORMS J. Comput., 2023

2022
Physical internet enabled two-tier city logistics solution in the new retail era.
Ind. Manag. Data Syst., 2022

A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem.
Comput. Ind. Eng., 2022

2021
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy.
Transp. Sci., 2021

An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting.
ACM Trans. Knowl. Discov. Data, 2021

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants.
INFORMS J. Comput., 2021

The Electric Vehicle Routing Problem with Nonlinear Charging Functions.
CoRR, 2021

Multiperiod Dispatching and Routing for On-Time Delivery in a Dynamic and Stochastic Environment.
CoRR, 2021

Learning to Pack: A Data-Driven Tree Search Algorithm for Large-Scale 3D Bin Packing Problem.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems.
INFORMS J. Comput., 2020

2019
Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction.
Transp. Sci., 2019

A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation.
Transp. Sci., 2019

2018
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints.
Eur. J. Oper. Res., 2018

2017
Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost.
Transp. Sci., 2017

2016
A fast implementation for the 2D/3D box placement problem.
Comput. Optim. Appl., 2016

2015
Two exact algorithms for the traveling umpire problem.
Eur. J. Oper. Res., 2015

On service consistency in multi-period vehicle routing.
Eur. J. Oper. Res., 2015

An Efficient Forest-Based Tabu Search Algorithm for the Split-delivery Vehicle Routing Problem.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints.
Eur. J. Oper. Res., 2014

Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost.
CoRR, 2014

2013
An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem.
Eur. J. Oper. Res., 2013


  Loading...