Gianpaolo Ghiani

Orcid: 0000-0002-5243-1799

According to our database1, Gianpaolo Ghiani authored at least 67 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A multi-modal tourist trip planner integrating road and pedestrian networks.
Expert Syst. Appl., March, 2024

2023
Recovering feasibility in real-time conflict-free vehicle routing.
Comput. Ind. Eng., September, 2023

A Surprisal-Based Greedy Heuristic for the Set Covering Problem.
Algorithms, July, 2023

Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem.
IEEE Access, 2023

2022
Leveraging knowledge discovery and knowledge visualization to define the "inner areas": an application to an Italian province.
J. Knowl. Manag., 2022

A scalable anticipatory policy for the dynamic pickup and delivery problem.
Comput. Oper. Res., 2022

2021
The multi-period p-center problem with time-dependent travel times.
Comput. Oper. Res., 2021

On path ranking in time-dependent graphs.
Comput. Oper. Res., 2021

Optimizing a waste collection system with solid waste transfer stations.
Comput. Ind. Eng., 2021

Properties and Bounds for the Single-vehicle Capacitated Routing Problem with Time-dependent Travel Times and Multiple Trips.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems.
Int. Trans. Oper. Res., 2020

A learn-and-construct framework for general mixed-integer programming problems.
Int. Trans. Oper. Res., 2020

An enhanced lower bound for the Time-Dependent Travelling Salesman Problem.
Comput. Oper. Res., 2020

Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning.
Algorithms, 2020

2019
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm.
Discret. Appl. Math., 2019

A branch-and-bound algorithm for the time-Dependent rural postman problem.
Comput. Oper. Res., 2019

2018
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows.
Transp. Sci., 2018

A branch-and-bound algorithm for the time-dependent travelling salesman problem.
Networks, 2018

Extracting Semantic Roles from Ungrammatical Sentences.
Proceedings of the Intelligent Systems and Applications, 2018

2017
Approximation neighborhood evaluation for the design of the logistics support of complex engineering systems.
RAIRO Oper. Res., 2017

Time-Dependent Routing.
Comput. Oper. Res., 2017

MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration.
Comput. Oper. Res., 2017

Training offer selection and course timetabling for remedial education.
Comput. Ind. Eng., 2017

Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs.
4OR, 2017

2016
Neighborhood Synthesis from an Ensemble of MIP and CP Models.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

2015
The time-dependent quickest path problem: Properties and bounds.
Networks, 2015

Model-based automatic neighborhood design by unsupervised learning.
Comput. Oper. Res., 2015

Time-dependent routing problems: A review.
Comput. Oper. Res., 2015

2014
A Note on the Ichoua, Gendreau, and Potvin (2003) Travel Time Model.
Transp. Sci., 2014

Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem.
Transp. Sci., 2014

Operations research in solid waste management: A survey of strategic and tactical issues.
Comput. Oper. Res., 2014

A lower bound for the quickest path problem.
Comput. Oper. Res., 2014

2012
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem.
Transp. Sci., 2012

2011
Probabilistic Model and Solution Algorithm for the Electricity Retailers in the Italian Market.
Algorithmic Oper. Res., 2011

2010
Shift Scheduling Problem in Same-Day Courier Industry.
Transp. Sci., 2010

Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem.
Networks, 2010

Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions.
J. Heuristics, 2010

Efficient Neighborhood Search for the Probabilistic Multi-Vehicle Pickup and Delivery Problem.
Asia Pac. J. Oper. Res., 2010

2008
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs.
Comput. Oper. Res., 2008

2007
New policies for the dynamic traveling salesman problem.
Optim. Methods Softw., 2007

Integrated Shipment Dispatching and Packing Problems: a Case Study.
J. Math. Model. Algorithms, 2007

Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design.
Eur. J. Oper. Res., 2007

A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework.
Comput. Optim. Appl., 2007

2006
Auction algorithms for decentralized parallel machine scheduling.
Parallel Comput., 2006

The Black and White Traveling Salesman Problem.
Oper. Res., 2006

Recent algorithmic advances for Arc Routing Problems.
Comput. Oper. Res., 2006

A constructive heuristic for the Undirected Rural Postman Problem.
Comput. Oper. Res., 2006

Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem.
Comput. Optim. Appl., 2006

2005
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem.
Networks, 2005

Waste collection in Southern Italy: solution of a real-life arc routing problem.
Int. Trans. Oper. Res., 2005

A heuristic for the periodic rural postman problem.
Comput. Oper. Res., 2005

2004
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.
Parallel Comput., 2004

Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions.
J. Math. Model. Algorithms, 2004

Solving the hierarchical Chinese postman problem as a rural postman problem.
Eur. J. Oper. Res., 2004

Operations research methods for resource management and scheduling in a computational grid: a survey.
Proceedings of the Grid Computing: The New Frontier of High Performance Computing [post-proceedings of the High Performance Computing Workshop, 2004

2003
Parallel tabu search for a pickup and delivery problem under track contention.
Parallel Comput., 2003

Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
Eur. J. Oper. Res., 2003

2002
The Arc Routing and Scheduling Problem with Transshipment.
Transp. Sci., 2002

A Lagrangean heuristic for the plant location problem with multiple facilities in the same site.
Optim. Methods Softw., 2002

The capacitated plant location problem with multiple facilities in the same site.
Comput. Oper. Res., 2002

2001
The capacitated arc routing problem with intermediate facilities.
Networks, 2001

The laser-plotter beam routing problem.
J. Oper. Res. Soc., 2001

2000
An algorithm for the hierarchical Chinese postman problem.
Oper. Res. Lett., 2000

A branch-and-cut algorithm for the Undirected Rural Postman Problem.
Math. Program., 2000

Dynamic positioning of idle automated guided vehicles.
J. Intell. Manuf., 2000

An efficient transformation of the generalized vehicle routing problem.
Eur. J. Oper. Res., 2000

1999
Eulerian location problems.
Networks, 1999


  Loading...