Ferdinando Pezzella

According to our database1, Ferdinando Pezzella authored at least 13 papers between 1984 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services.
Discret. Appl. Math., 2019

A path-based solution approach for the Green Vehicle Routing Problem.
Comput. Oper. Res., 2019

2018
A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems.
J. Comb. Optim., 2018

2017
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges.
Electron. Notes Discret. Math., 2017

Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems.
Discret. Optim., 2017

2016
A new Mathematical Programming Model for the Green Vehicle Routing Problem.
Electron. Notes Discret. Math., 2016

2015
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows.
Electron. Notes Discret. Math., 2015

2013
A heuristic and an exact method for the gate matrix connection cost minimization problem.
Int. Trans. Oper. Res., 2013

2010
An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem.
Eur. J. Oper. Res., 2010

2008
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem.
Math. Methods Oper. Res., 2008

A genetic algorithm for the Flexible Job-shop Scheduling Problem.
Comput. Oper. Res., 2008

2000
A tabu search method guided by shifting bottleneck for the job shop scheduling problem.
Eur. J. Oper. Res., 2000

1984
Confidence intervals in the solution of stochastic integer linear programming problems.
Ann. Oper. Res., 1984


  Loading...