void CVRPSolver::insertUnservedOrders(CSolutionInfo& curSolution) {
++m_iGeneratedSolutionCount;
++m_iStepsSinceLastSolution;
bool insertAvailable = true;
CMoveInfo curMove;
int totalUnservedOrder = static_cast<int>(m_vOrderInfos.size() - curSolution.getOrderServed());
while (insertAvailable && totalUnservedOrder > 0) {
int insertTourId = -1;
insertAvailable = false;
int totalTour = static_cast<int>(curSolution.getTourInfoVector().size());
std::pair<int, int> PotentialInsert; // first = insert_index, second = removed_customer_index;
std::pair<int, double> bestInsert = std::make_pair(-1, DOUBLE_MAX); // first = customer_insert_index, second = cost;
for (int j = 0; j < totalTour; ++j) {
CTourInfo curTour = curSolution.getTour(j);
curMove.setInitialTour(curTour);
for (int i = 0; i < totalUnservedOrder; ++i) {
int ordIndex = m_mapOrderIdToIndex[curSolution.getUnservedOrderAt(i)];
COrderInfo curOrder = m_vOrderInfos[ordIndex];
std::pair<int, double> curInsert = getPotentialInsert(curTour, curOrder);
insertOrder(curTour, i, curInsert.first);
curMove.setModifiedTour(curTour);
curMove.getInitialTour(curTour);
// check if current move is tabu.
if (isTabuMove(curMove)) {
continue;
}
if (curInsert.second < bestInsert.second) {
insertTourId = j;
insertAvailable = true;
bestInsert = curInsert;
PotentialInsert = std::make_pair(curInsert.first, i);
}
}
}
if (insertAvailable) {
totalUnservedOrder--;
curMove.setInitialTour(curSolution.getTour(insertTourId));
addOrderAtTour(curSolution, insertTourId,
PotentialInsert.first,
PotentialInsert.second);
curMove.setModifiedTour(curSolution.getTour(insertTourId));
this->updateTabuCount(curMove);
this->updateFinalSolution(curSolution); // this->evaluateCurrentSolution();
}
}
}
CSolutionInfo CVRPSolver::generateInitialSolution() {
CSolutionInfo initialSolution;
PGR_LOG("Inside gen ini sol");
std::vector<int> vecOrders, vecVehicles;
for (unsigned int i = 0; i < m_vOrderInfos.size(); i++) {
vecOrders.push_back(m_vOrderInfos[i].getOrderId());
}
for (unsigned int i = 0; i < m_vVehicleInfos.size(); i++) {
vecVehicles.push_back(m_vVehicleInfos[i].getId());
}
initialSolution.init(vecOrders, static_cast<int>(vecOrders.size()), vecVehicles);
int iUnusedVehicles = static_cast<int>(initialSolution.getUnusedVehicleCount());
int iUnservedOrders = static_cast<int>(initialSolution.getUnservedOrderCount()); // m_viUnservedOrderIndex.size();
PGR_LOG("before while");
while (iUnusedVehicles && iUnservedOrders) {
CTourInfo curTour;
int vehicleIndex = rand() % iUnusedVehicles--;
int vehicleInd = m_mapVehicleIdToIndex[initialSolution.getUnusedVehicleAt(vehicleIndex)];
curTour.setVehicleInfo(m_vVehicleInfos[vehicleInd]); // m_viUnusedVehicleIndex[vehicleIndex]
initialSolution.removeVehicle(vehicleIndex);
curTour.setStartDepot(m_vDepotInfos[0].getDepotId());
curTour.setEndDepot(m_vDepotInfos[0].getDepotId());
// use a random seed to start to tour. (we can use better approach in future)
bool insertAvailable = true;
while (insertAvailable) {
insertAvailable = false;
std::pair<int, int> PotentialInsert; // first = insert_index, second = removed_order_index;
std::pair<int, double> bestInsert = std::make_pair(-1, DOUBLE_MAX); // first = order_insert_index, second = cost;
for (int i = 0; i < iUnservedOrders; ++i) {
int orderInd = m_mapOrderIdToIndex[initialSolution.getUnservedOrderAt(i)];
COrderInfo curOrder = m_vOrderInfos[orderInd];
std::pair<int, double> curInsert = getPotentialInsert(curTour, curOrder);
if (curInsert.second < bestInsert.second) {
insertAvailable = true;
bestInsert = curInsert;
PotentialInsert = std::make_pair(curInsert.first, i);
}
}
if (insertAvailable) {
if (insertOrder(curTour, initialSolution.getUnservedOrderAt(PotentialInsert.second), PotentialInsert.first)) {
iUnservedOrders--;
initialSolution.removeOrder(PotentialInsert.second);
}
}
}
initialSolution.addTour(curTour);
}
return initialSolution;
}
