As you know, most of the time, a charging station is assumed to be visited more than once in electric vehicle routing problem and this situation can be modelled by determining a dummy set of vertices considering set of the original charging station as also stated by Schneider et al(2014). How can I code this dummy vertices on CPLEX ILOG? I have just tried to solve this by simply duplicating the rows of charging stations in the data file. But, this method seems not so effective since it increases the problem dimension. Is there any other way that you can recommend?
You should consider another set of nodes for charging stations, and a third set containing all nodes, points, and charging stations thereafter.
Dear Mehmet Anil Akbay,
I suggest you to see links and attached files on topic.
https://www.amazon.com/Handbook-Visualization-Discrete-Mathematics-Applications/dp/113803424X
https://core.ac.uk/download/pdf/11010985.pdf
Article Local Protein Threading by Mixed Integer Programming
Best regards
You can get rid of the dummy variables and obtain a much stronger formulation by using a multigraph transformation described in any of these papers:
Thesis Optimal routing of electric vehicles
Article An Exact Algorithm for the Green Vehicle Routing Problem
Article A multi-start local search heuristic for the Green Vehicle R...