@iyulab/u-routing 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 iyulab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,125 @@
+# u-routing
+
+[![Crates.io](https://img.shields.io/crates/v/u-routing.svg)](https://crates.io/crates/u-routing)
+[![docs.rs](https://docs.rs/u-routing/badge.svg)](https://docs.rs/u-routing)
+[![CI](https://github.com/iyulab/u-routing/actions/workflows/ci.yml/badge.svg)](https://github.com/iyulab/u-routing/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE)
+
+Vehicle routing optimization library providing building-block algorithms for
+TSP, CVRP, and VRPTW variants.
+
+## Features
+
+- **Models** — Customer, Vehicle, Route, Solution, TimeWindow, RoutingProblem trait
+- **Distance** — Dense distance/travel-time matrix with nearest-neighbor lookup
+- **Evaluation** — Route feasibility checking (capacity, time windows, max distance/duration)
+- **Constructive heuristics** — Nearest Neighbor (O(n²)), Clarke-Wright Savings (O(n² log n))
+- **Local search** — Intra-route 2-opt (Croes 1958), inter-route Relocate (Or 1976)
+- **Genetic algorithm** — Giant tour + Prins (2004) split DP, OX crossover, 2-opt refinement
+- **ALNS** — Random/Worst/Shaw removal + Greedy/Regret-k insertion (Ropke & Pisinger 2006)
+
+## Quick Start
+
+```rust
+use u_routing::models::{Customer, Vehicle};
+use u_routing::distance::DistanceMatrix;
+use u_routing::constructive::nearest_neighbor;
+use u_routing::local_search::{two_opt_improve, relocate_improve};
+
+let customers = vec![
+    Customer::depot(0.0, 0.0),
+    Customer::new(1, 1.0, 0.0, 10, 0.0),
+    Customer::new(2, 2.0, 0.0, 10, 0.0),
+    Customer::new(3, 3.0, 0.0, 10, 0.0),
+];
+let dm = DistanceMatrix::from_customers(&customers);
+let vehicles = vec![Vehicle::new(0, 30)];
+
+// Constructive → Local search pipeline
+let initial = nearest_neighbor(&customers, &dm, &vehicles);
+let improved = relocate_improve(&initial, &customers, &dm, &vehicles[0]);
+println!("Distance: {}", improved.total_distance());
+```
+
+### GA Solver
+
+```rust
+use u_routing::models::Customer;
+use u_routing::distance::DistanceMatrix;
+use u_routing::ga::RoutingGaProblem;
+use u_metaheur::ga::{GaConfig, GaRunner};
+
+let customers = vec![
+    Customer::depot(0.0, 0.0),
+    Customer::new(1, 1.0, 0.0, 10, 0.0),
+    Customer::new(2, 2.0, 0.0, 10, 0.0),
+    Customer::new(3, 3.0, 0.0, 10, 0.0),
+];
+let dm = DistanceMatrix::from_customers(&customers);
+
+let problem = RoutingGaProblem::new(customers, dm, 30);
+let config = GaConfig::default()
+    .with_population_size(50)
+    .with_max_generations(200);
+
+let result = GaRunner::run(&problem, &config);
+println!("Best distance: {}", result.best_fitness);
+```
+
+### ALNS Solver
+
+```rust
+use u_routing::models::Customer;
+use u_routing::distance::DistanceMatrix;
+use u_routing::alns::{RoutingAlnsProblem, destroy::RandomRemoval, repair::GreedyInsertion};
+use u_metaheur::alns::{AlnsConfig, AlnsRunner};
+
+let customers = vec![
+    Customer::depot(0.0, 0.0),
+    Customer::new(1, 1.0, 0.0, 10, 0.0),
+    Customer::new(2, 2.0, 0.0, 10, 0.0),
+    Customer::new(3, 3.0, 0.0, 10, 0.0),
+];
+let dm = DistanceMatrix::from_customers(&customers);
+
+let problem = RoutingAlnsProblem::new(customers.clone(), dm.clone(), 30);
+let destroy = vec![RandomRemoval];
+let repair = vec![GreedyInsertion::new(dm, customers, 30)];
+let config = AlnsConfig::default().with_max_iterations(5000).with_seed(42);
+
+let result = AlnsRunner::run(&problem, &destroy, &repair, &config);
+println!("Best cost: {}", result.best_cost);
+```
+
+## Architecture
+
+```
+u-routing
+├── models/          Domain types (Customer, Vehicle, Route, Solution)
+├── distance/        Distance matrix
+├── evaluation/      Route evaluator + constraint checking
+├── constructive/    Nearest Neighbor, Clarke-Wright Savings
+├── local_search/    2-opt, Relocate
+├── ga/              Giant tour + Split DP + GaProblem bridge
+└── alns/            Destroy/Repair operators + AlnsProblem bridge
+```
+
+## Dependencies
+
+- [`u-metaheur`](https://crates.io/crates/u-metaheur) — GA/ALNS framework
+- [`u-numflow`](https://crates.io/crates/u-numflow) — Math primitives, RNG
+
+## References
+
+- Clarke, G. & Wright, J.W. (1964). "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points"
+- Croes, G.A. (1958). "A method for solving traveling salesman problems"
+- Or, I. (1976). "Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking"
+- Prins, C. (2004). "A simple and effective evolutionary algorithm for the vehicle routing problem"
+- Ropke, S. & Pisinger, D. (2006). "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows"
+- Shaw, P. (1998). "Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems"
+
+## Related
+
+- [u-numflow](https://crates.io/crates/u-numflow) — Mathematical optimization primitives
+- [u-metaheur](https://crates.io/crates/u-metaheur) — Metaheuristic algorithms
+- [u-schedule](https://crates.io/crates/u-schedule) — Scheduling optimization

package/package.json

@@ -0,0 +1,33 @@
+{
+  "name": "@iyulab/u-routing",
+  "type": "module",
+  "collaborators": [
+    "iyulab"
+  ],
+  "description": "Vehicle routing optimization: TSP, CVRP, VRPTW with constructive heuristics, local search, GA, and ALNS.",
+  "version": "0.1.0",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/iyulab/u-routing"
+  },
+  "files": [
+    "u_routing_bg.wasm",
+    "u_routing.js",
+    "u_routing_bg.js",
+    "u_routing.d.ts"
+  ],
+  "main": "u_routing.js",
+  "types": "u_routing.d.ts",
+  "sideEffects": [
+    "./u_routing.js",
+    "./snippets/*"
+  ],
+  "keywords": [
+    "routing",
+    "vrp",
+    "tsp",
+    "optimization",
+    "logistics"
+  ]
+}

package/u_routing.d.ts

@@ -0,0 +1,16 @@
+/* tslint:disable */
+/* eslint-disable */
+
+/**
+ * Solve a capacitated VRP problem given as JSON.
+ *
+ * # Arguments
+ * * `problem_json` — A JS object matching the VRP input schema.
+ *
+ * # Returns
+ * A JS object with `routes`, `total_distance`, and `num_vehicles`.
+ *
+ * # Errors
+ * Returns a `JsValue` string describing the error if input is invalid.
+ */
+export function solve_vrp(problem_json: any): any;

package/u_routing.js

@@ -0,0 +1,9 @@
+/* @ts-self-types="./u_routing.d.ts" */
+
+import * as wasm from "./u_routing_bg.wasm";
+import { __wbg_set_wasm } from "./u_routing_bg.js";
+__wbg_set_wasm(wasm);
+wasm.__wbindgen_start();
+export {
+    solve_vrp
+} from "./u_routing_bg.js";

package/u_routing_bg.js

@@ -0,0 +1,404 @@
+/**
+ * Solve a capacitated VRP problem given as JSON.
+ *
+ * # Arguments
+ * * `problem_json` — A JS object matching the VRP input schema.
+ *
+ * # Returns
+ * A JS object with `routes`, `total_distance`, and `num_vehicles`.
+ *
+ * # Errors
+ * Returns a `JsValue` string describing the error if input is invalid.
+ * @param {any} problem_json
+ * @returns {any}
+ */
+export function solve_vrp(problem_json) {
+    const ret = wasm.solve_vrp(problem_json);
+    if (ret[2]) {
+        throw takeFromExternrefTable0(ret[1]);
+    }
+    return takeFromExternrefTable0(ret[0]);
+}
+export function __wbg_Error_83742b46f01ce22d(arg0, arg1) {
+    const ret = Error(getStringFromWasm0(arg0, arg1));
+    return ret;
+}
+export function __wbg_Number_a5a435bd7bbec835(arg0) {
+    const ret = Number(arg0);
+    return ret;
+}
+export function __wbg_String_8564e559799eccda(arg0, arg1) {
+    const ret = String(arg1);
+    const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    const len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_bigint_get_as_i64_447a76b5c6ef7bda(arg0, arg1) {
+    const v = arg1;
+    const ret = typeof(v) === 'bigint' ? v : undefined;
+    getDataViewMemory0().setBigInt64(arg0 + 8 * 1, isLikeNone(ret) ? BigInt(0) : ret, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, !isLikeNone(ret), true);
+}
+export function __wbg___wbindgen_boolean_get_c0f3f60bac5a78d1(arg0) {
+    const v = arg0;
+    const ret = typeof(v) === 'boolean' ? v : undefined;
+    return isLikeNone(ret) ? 0xFFFFFF : ret ? 1 : 0;
+}
+export function __wbg___wbindgen_debug_string_5398f5bb970e0daa(arg0, arg1) {
+    const ret = debugString(arg1);
+    const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    const len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_in_41dbb8413020e076(arg0, arg1) {
+    const ret = arg0 in arg1;
+    return ret;
+}
+export function __wbg___wbindgen_is_bigint_e2141d4f045b7eda(arg0) {
+    const ret = typeof(arg0) === 'bigint';
+    return ret;
+}
+export function __wbg___wbindgen_is_function_3c846841762788c1(arg0) {
+    const ret = typeof(arg0) === 'function';
+    return ret;
+}
+export function __wbg___wbindgen_is_object_781bc9f159099513(arg0) {
+    const val = arg0;
+    const ret = typeof(val) === 'object' && val !== null;
+    return ret;
+}
+export function __wbg___wbindgen_is_undefined_52709e72fb9f179c(arg0) {
+    const ret = arg0 === undefined;
+    return ret;
+}
+export function __wbg___wbindgen_jsval_eq_ee31bfad3e536463(arg0, arg1) {
+    const ret = arg0 === arg1;
+    return ret;
+}
+export function __wbg___wbindgen_jsval_loose_eq_5bcc3bed3c69e72b(arg0, arg1) {
+    const ret = arg0 == arg1;
+    return ret;
+}
+export function __wbg___wbindgen_number_get_34bb9d9dcfa21373(arg0, arg1) {
+    const obj = arg1;
+    const ret = typeof(obj) === 'number' ? obj : undefined;
+    getDataViewMemory0().setFloat64(arg0 + 8 * 1, isLikeNone(ret) ? 0 : ret, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, !isLikeNone(ret), true);
+}
+export function __wbg___wbindgen_string_get_395e606bd0ee4427(arg0, arg1) {
+    const obj = arg1;
+    const ret = typeof(obj) === 'string' ? obj : undefined;
+    var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    var len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_throw_6ddd609b62940d55(arg0, arg1) {
+    throw new Error(getStringFromWasm0(arg0, arg1));
+}
+export function __wbg_call_e133b57c9155d22c() { return handleError(function (arg0, arg1) {
+    const ret = arg0.call(arg1);
+    return ret;
+}, arguments); }
+export function __wbg_done_08ce71ee07e3bd17(arg0) {
+    const ret = arg0.done;
+    return ret;
+}
+export function __wbg_get_326e41e095fb2575() { return handleError(function (arg0, arg1) {
+    const ret = Reflect.get(arg0, arg1);
+    return ret;
+}, arguments); }
+export function __wbg_get_unchecked_329cfe50afab7352(arg0, arg1) {
+    const ret = arg0[arg1 >>> 0];
+    return ret;
+}
+export function __wbg_get_with_ref_key_6412cf3094599694(arg0, arg1) {
+    const ret = arg0[arg1];
+    return ret;
+}
+export function __wbg_instanceof_ArrayBuffer_101e2bf31071a9f6(arg0) {
+    let result;
+    try {
+        result = arg0 instanceof ArrayBuffer;
+    } catch (_) {
+        result = false;
+    }
+    const ret = result;
+    return ret;
+}
+export function __wbg_instanceof_Uint8Array_740438561a5b956d(arg0) {
+    let result;
+    try {
+        result = arg0 instanceof Uint8Array;
+    } catch (_) {
+        result = false;
+    }
+    const ret = result;
+    return ret;
+}
+export function __wbg_isArray_33b91feb269ff46e(arg0) {
+    const ret = Array.isArray(arg0);
+    return ret;
+}
+export function __wbg_isSafeInteger_ecd6a7f9c3e053cd(arg0) {
+    const ret = Number.isSafeInteger(arg0);
+    return ret;
+}
+export function __wbg_iterator_d8f549ec8fb061b1() {
+    const ret = Symbol.iterator;
+    return ret;
+}
+export function __wbg_length_b3416cf66a5452c8(arg0) {
+    const ret = arg0.length;
+    return ret;
+}
+export function __wbg_length_ea16607d7b61445b(arg0) {
+    const ret = arg0.length;
+    return ret;
+}
+export function __wbg_new_5f486cdf45a04d78(arg0) {
+    const ret = new Uint8Array(arg0);
+    return ret;
+}
+export function __wbg_new_a70fbab9066b301f() {
+    const ret = new Array();
+    return ret;
+}
+export function __wbg_new_ab79df5bd7c26067() {
+    const ret = new Object();
+    return ret;
+}
+export function __wbg_next_11b99ee6237339e3() { return handleError(function (arg0) {
+    const ret = arg0.next();
+    return ret;
+}, arguments); }
+export function __wbg_next_e01a967809d1aa68(arg0) {
+    const ret = arg0.next;
+    return ret;
+}
+export function __wbg_prototypesetcall_d62e5099504357e6(arg0, arg1, arg2) {
+    Uint8Array.prototype.set.call(getArrayU8FromWasm0(arg0, arg1), arg2);
+}
+export function __wbg_set_282384002438957f(arg0, arg1, arg2) {
+    arg0[arg1 >>> 0] = arg2;
+}
+export function __wbg_set_6be42768c690e380(arg0, arg1, arg2) {
+    arg0[arg1] = arg2;
+}
+export function __wbg_value_21fc78aab0322612(arg0) {
+    const ret = arg0.value;
+    return ret;
+}
+export function __wbindgen_cast_0000000000000001(arg0) {
+    // Cast intrinsic for `F64 -> Externref`.
+    const ret = arg0;
+    return ret;
+}
+export function __wbindgen_cast_0000000000000002(arg0, arg1) {
+    // Cast intrinsic for `Ref(String) -> Externref`.
+    const ret = getStringFromWasm0(arg0, arg1);
+    return ret;
+}
+export function __wbindgen_cast_0000000000000003(arg0) {
+    // Cast intrinsic for `U64 -> Externref`.
+    const ret = BigInt.asUintN(64, arg0);
+    return ret;
+}
+export function __wbindgen_init_externref_table() {
+    const table = wasm.__wbindgen_externrefs;
+    const offset = table.grow(4);
+    table.set(0, undefined);
+    table.set(offset + 0, undefined);
+    table.set(offset + 1, null);
+    table.set(offset + 2, true);
+    table.set(offset + 3, false);
+}
+function addToExternrefTable0(obj) {
+    const idx = wasm.__externref_table_alloc();
+    wasm.__wbindgen_externrefs.set(idx, obj);
+    return idx;
+}
+
+function debugString(val) {
+    // primitive types
+    const type = typeof val;
+    if (type == 'number' || type == 'boolean' || val == null) {
+        return  `${val}`;
+    }
+    if (type == 'string') {
+        return `"${val}"`;
+    }
+    if (type == 'symbol') {
+        const description = val.description;
+        if (description == null) {
+            return 'Symbol';
+        } else {
+            return `Symbol(${description})`;
+        }
+    }
+    if (type == 'function') {
+        const name = val.name;
+        if (typeof name == 'string' && name.length > 0) {
+            return `Function(${name})`;
+        } else {
+            return 'Function';
+        }
+    }
+    // objects
+    if (Array.isArray(val)) {
+        const length = val.length;
+        let debug = '[';
+        if (length > 0) {
+            debug += debugString(val[0]);
+        }
+        for(let i = 1; i < length; i++) {
+            debug += ', ' + debugString(val[i]);
+        }
+        debug += ']';
+        return debug;
+    }
+    // Test for built-in
+    const builtInMatches = /\[object ([^\]]+)\]/.exec(toString.call(val));
+    let className;
+    if (builtInMatches && builtInMatches.length > 1) {
+        className = builtInMatches[1];
+    } else {
+        // Failed to match the standard '[object ClassName]'
+        return toString.call(val);
+    }
+    if (className == 'Object') {
+        // we're a user defined class or Object
+        // JSON.stringify avoids problems with cycles, and is generally much
+        // easier than looping through ownProperties of `val`.
+        try {
+            return 'Object(' + JSON.stringify(val) + ')';
+        } catch (_) {
+            return 'Object';
+        }
+    }
+    // errors
+    if (val instanceof Error) {
+        return `${val.name}: ${val.message}\n${val.stack}`;
+    }
+    // TODO we could test for more things here, like `Set`s and `Map`s.
+    return className;
+}
+
+function getArrayU8FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint8ArrayMemory0().subarray(ptr / 1, ptr / 1 + len);
+}
+
+let cachedDataViewMemory0 = null;
+function getDataViewMemory0() {
+    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
+        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
+    }
+    return cachedDataViewMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return decodeText(ptr, len);
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function handleError(f, args) {
+    try {
+        return f.apply(this, args);
+    } catch (e) {
+        const idx = addToExternrefTable0(e);
+        wasm.__wbindgen_exn_store(idx);
+    }
+}
+
+function isLikeNone(x) {
+    return x === undefined || x === null;
+}
+
+function passStringToWasm0(arg, malloc, realloc) {
+    if (realloc === undefined) {
+        const buf = cachedTextEncoder.encode(arg);
+        const ptr = malloc(buf.length, 1) >>> 0;
+        getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf);
+        WASM_VECTOR_LEN = buf.length;
+        return ptr;
+    }
+
+    let len = arg.length;
+    let ptr = malloc(len, 1) >>> 0;
+
+    const mem = getUint8ArrayMemory0();
+
+    let offset = 0;
+
+    for (; offset < len; offset++) {
+        const code = arg.charCodeAt(offset);
+        if (code > 0x7F) break;
+        mem[ptr + offset] = code;
+    }
+    if (offset !== len) {
+        if (offset !== 0) {
+            arg = arg.slice(offset);
+        }
+        ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0;
+        const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len);
+        const ret = cachedTextEncoder.encodeInto(arg, view);
+
+        offset += ret.written;
+        ptr = realloc(ptr, len, offset, 1) >>> 0;
+    }
+
+    WASM_VECTOR_LEN = offset;
+    return ptr;
+}
+
+function takeFromExternrefTable0(idx) {
+    const value = wasm.__wbindgen_externrefs.get(idx);
+    wasm.__externref_table_dealloc(idx);
+    return value;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+const MAX_SAFARI_DECODE_BYTES = 2146435072;
+let numBytesDecoded = 0;
+function decodeText(ptr, len) {
+    numBytesDecoded += len;
+    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
+        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+        cachedTextDecoder.decode();
+        numBytesDecoded = len;
+    }
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+const cachedTextEncoder = new TextEncoder();
+
+if (!('encodeInto' in cachedTextEncoder)) {
+    cachedTextEncoder.encodeInto = function (arg, view) {
+        const buf = cachedTextEncoder.encode(arg);
+        view.set(buf);
+        return {
+            read: arg.length,
+            written: buf.length
+        };
+    };
+}
+
+let WASM_VECTOR_LEN = 0;
+
+
+let wasm;
+export function __wbg_set_wasm(val) {
+    wasm = val;
+}