{"action":"closed","issue":{"url":"https://api.github.com/repos/jsprit/jsprit/issues/163","labels_url":"https://api.github.com/repos/jsprit/jsprit/issues/163/labels{/name}","comments_url":"https://api.github.com/repos/jsprit/jsprit/issues/163/comments","events_url":"https://api.github.com/repos/jsprit/jsprit/issues/163/events","html_url":"https://github.com/jsprit/jsprit/issues/163","id":87993347,"number":163,"title":"Question: Optimize for fix number of vehicles evenly","user":{"login":"balage1551","id":11457054,"avatar_url":"https://avatars.githubusercontent.com/u/11457054?v=3","gravatar_id":"","url":"https://api.github.com/users/balage1551","html_url":"https://github.com/balage1551","followers_url":"https://api.github.com/users/balage1551/followers","following_url":"https://api.github.com/users/balage1551/following{/other_user}","gists_url":"https://api.github.com/users/balage1551/gists{/gist_id}","starred_url":"https://api.github.com/users/balage1551/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/balage1551/subscriptions","organizations_url":"https://api.github.com/users/balage1551/orgs","repos_url":"https://api.github.com/users/balage1551/repos","events_url":"https://api.github.com/users/balage1551/events{/privacy}","received_events_url":"https://api.github.com/users/balage1551/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":12,"created_at":"2015-06-13T12:02:59Z","updated_at":"2015-07-22T15:40:51Z","closed_at":"2015-07-22T15:40:51Z","body":"Hello,\r\n\r\nI am amazed with your library for VRP-related problems. They are well designed and easy to use.\r\n\r\nHowever, I have a problem to solve and being new with your API, I am not sure how to solve it. \r\n\r\nMy problem is a m-VRP-TW (a multiple vehicle, pick and delivery routing problem, with time windows). The examples I found in your project covers this problem well, but they all seem to optimize for vehicle number, meaning it will use no more vehicles than they should. However, I need to find a solution, when all the vehicles (within sanity bounds) are used and are utilized as evenly as it could be managed.\r\n\r\nHere is an over-simplified example: let's have 100 tasks (let's ignore tw for the sake of simplicity) requiring 1 time unit each and having 10 vehicles with time unit \"capacity\" of 20.\r\nThe solution in the examples would distribute the tasks for 5 vehicles (maybe 6) each having approximatly 20 tasks. \r\nOTOH, what I need is a solution where all 10 vehicles are in use having approximatly 10 task each.\r\n\r\nI feel somehow the cost heuristics should be tweaked, but the code base is too big to find the right way.\r\n\r\nThanks for your help,\r\nBalage"}}