LotSizingProblems.jl

This package reads data files for Capacitated Lot Sizing Problem (CLSP) instances.

Usage

The type used by the package is LotSizingProblem, defined as follows:

struct LotSizingProblem
    name::String                        # Instance name

    cost::Int64                         # Unitary production cost
    capacity::Int64                     # Capacity

    consumptions::Vector{Float64}       # Unitary resource consumption
    inv_costs::Vector{Float64}          # Unitary inventory costs
    setup_consumptions::Vector{Float64} # Setup resource consumptions
    setup_costs::Vector{Float64}        # Setup costs
    demands::Matrix{Int64}              # Demands

    lb::Float64                         # Lower bound (-Inf if not known)
    ub::Float64                         # Upper bound ( Inf if not known)
end

The package also provides two helper functions ni(data) and np(data), which return the number of items and periods, respectively.

Some classical CLSP instances from the literature are preloaded. For example, to load CLSP instance X11117A:

clsp = loadLotSizingProblem(:X11117A)

The package also loads custom CLSP instances. For example:

clsp = loadLotSizingProblem("/full/path/to/your/instance")

Installation

LotSizingProblems is not a registered Julia Package...

You can install LotSizingProblems through the Julia package manager.

Open Julia's interactive session (REPL) and type:

] add https://github.com/rafaelmartinelli/LotSizingProblems.jl

Do not forget to ⭐star⭐ our package! 😁

Other packages

• Knapsacks.jl: Knapsack algorithms in Julia
• InventoryRoutingProblems.jl: Inventory Routing Problems Lib
• FacilityLocationProblems.jl: Facility Location Problems Lib
• AssignmentProblems.jl: Assignment Problems Lib
• BPPLib.jl: Bin Packing and Cutting Stock Problems Lib
• CARPData.jl: Capacitated Arc Routing Problem Lib
• MDVSP.jl: Multiple-Depot Vehicle Scheduling Problem Lib
• CVRPLIB.jl: Capacitated Vehicle Routing Problem Lib
• TSPLIB.jl: Traveling Salesman Problem Lib