// the find
Amoiensis/JD-Logistics-Scheduling-GOC
Solution for JD-GOC Logistics Scheduling Problem. (排名-初赛: 64, 复赛: 38). JD GOC 城市物流调度比赛的解题源代码+结果检测程序.
C source code (plus competition data and a verifier tool) for a mid-pack entry (64th/38th place) in JD's 2018 GOC vehicle routing competition — a VRP variant with time windows, EV charging, and pickup/delivery. Useful mainly for OR/VRP coursework or anyone benchmarking against a real competition dataset, not as a production routing library.
Ships the actual anonymized competition data plus a separate feasibility checker (with its own source and a usage PDF), so results are independently verifiable instead of just taking the author's word. The problem formulation itself is non-trivial — capacity, time windows, EV charging, and backhaul pickup/delivery in one model, which is more than the usual toy VRP demo. Documentation includes a parameter-explanation PDF and a competition report, so the context isn't just a terse README.
Build system is Dev-C++ project files (.dev/.layout) plus a Makefile.win — no CMake, no cross-platform build, and the toolchain is effectively dead outside that one Windows IDE. The solver is explicitly an unfinished nearest-neighbor construction heuristic with no local search or metaheuristic improvement phase shipped ('could be improved with other methods later'), and the competition placement (64/38) reflects that. The README states 'do not reprint without permission, academic use only,' which directly conflicts with having an open LICENSE file in the repo — unclear what you're actually allowed to do with the code. No tests, no CI, and directory/file names mix Chinese and English in ways that will trip up tooling on non-UTF-8-friendly systems.